On the complexity of genuinely polynomial computation
M. Karpinski, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.
Download
No fulltext has been uploaded.
Book Chapter
| Published
| English
Author
Karpinski, Marek;
Meyer auf der Heide, FriedhelmLibreCat
Publishing Year
Book Title
Lecture Notes in Computer Science
ISBN
LibreCat-ID
Cite this
Karpinski M, Meyer auf der Heide F. On the complexity of genuinely polynomial computation. In: Lecture Notes in Computer Science. Berlin/Heidelberg; 1990. doi:10.1007/bfb0029630
Karpinski, M., & Meyer auf der Heide, F. (1990). On the complexity of genuinely polynomial computation. In Lecture Notes in Computer Science. Berlin/Heidelberg. https://doi.org/10.1007/bfb0029630
@inbook{Karpinski_Meyer auf der Heide_1990, place={Berlin/Heidelberg}, title={On the complexity of genuinely polynomial computation}, DOI={10.1007/bfb0029630}, booktitle={Lecture Notes in Computer Science}, author={Karpinski, Marek and Meyer auf der Heide, Friedhelm}, year={1990} }
Karpinski, Marek, and Friedhelm Meyer auf der Heide. “On the Complexity of Genuinely Polynomial Computation.” In Lecture Notes in Computer Science. Berlin/Heidelberg, 1990. https://doi.org/10.1007/bfb0029630.
M. Karpinski and F. Meyer auf der Heide, “On the complexity of genuinely polynomial computation,” in Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.
Karpinski, Marek, and Friedhelm Meyer auf der Heide. “On the Complexity of Genuinely Polynomial Computation.” Lecture Notes in Computer Science, 1990, doi:10.1007/bfb0029630.
Google Scholar
ISBN Search