{"language":[{"iso":"eng"}],"publication_status":"published","doi":"10.1007/bfb0029630","type":"book_chapter","date_updated":"2022-01-06T06:52:55Z","publication":"Lecture Notes in Computer Science","status":"public","year":"1990","place":"Berlin/Heidelberg","author":[{"first_name":"Marek","full_name":"Karpinski, Marek","last_name":"Karpinski"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"_id":"16740","title":"On the complexity of genuinely polynomial computation","publication_identifier":{"isbn":["3540529535"]},"department":[{"_id":"63"}],"user_id":"15415","citation":{"ieee":"M. Karpinski and F. Meyer auf der Heide, “On the complexity of genuinely polynomial computation,” in <i>Lecture Notes in Computer Science</i>, Berlin/Heidelberg, 1990.","mla":"Karpinski, Marek, and Friedhelm Meyer auf der Heide. “On the Complexity of Genuinely Polynomial Computation.” <i>Lecture Notes in Computer Science</i>, 1990, doi:<a href=\"https://doi.org/10.1007/bfb0029630\">10.1007/bfb0029630</a>.","ama":"Karpinski M, Meyer auf der Heide F. On the complexity of genuinely polynomial computation. In: <i>Lecture Notes in Computer Science</i>. Berlin/Heidelberg; 1990. doi:<a href=\"https://doi.org/10.1007/bfb0029630\">10.1007/bfb0029630</a>","bibtex":"@inbook{Karpinski_Meyer auf der Heide_1990, place={Berlin/Heidelberg}, title={On the complexity of genuinely polynomial computation}, DOI={<a href=\"https://doi.org/10.1007/bfb0029630\">10.1007/bfb0029630</a>}, booktitle={Lecture Notes in Computer Science}, author={Karpinski, Marek and Meyer auf der Heide, Friedhelm}, year={1990} }","apa":"Karpinski, M., &#38; Meyer auf der Heide, F. (1990). On the complexity of genuinely polynomial computation. In <i>Lecture Notes in Computer Science</i>. Berlin/Heidelberg. <a href=\"https://doi.org/10.1007/bfb0029630\">https://doi.org/10.1007/bfb0029630</a>","short":"M. Karpinski, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.","chicago":"Karpinski, Marek, and Friedhelm Meyer auf der Heide. “On the Complexity of Genuinely Polynomial Computation.” In <i>Lecture Notes in Computer Science</i>. Berlin/Heidelberg, 1990. <a href=\"https://doi.org/10.1007/bfb0029630\">https://doi.org/10.1007/bfb0029630</a>."},"date_created":"2020-04-20T11:40:17Z"}