{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:48:18Z","timestamp":1725468498230},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648277"},{"type":"electronic","value":"9783540685326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055797","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T13:36:31Z","timestamp":1155821791000},"page":"474-482","source":"Crossref","is-referenced-by-count":0,"title":["Positive turing and truth-table completeness for NEXP are incomparable"],"prefix":"10.1007","author":[{"given":"Levke","family":"Bentzien","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"44_CR1","volume-title":"PhD thesis","author":"H. Buhrman","year":"1993","unstructured":"H. Buhrman. Resource Bounded Reductions. PhD thesis, Universiteit van Amsterdam, Amsterdam, 1993."},{"key":"44_CR2","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF02090397","volume":"24","author":"H. Buhrmann","year":"1991","unstructured":"H. Buhrmann, S. Homer, and L. Torenvliet. Completeness for nondeterministic complexity classes. Mathematical Systems Theory\n                24, 179\u2013200, 1991.","journal-title":"Mathematical Systems Theory"},{"key":"44_CR3","unstructured":"H. Buhrmann, E. Spaan, and L. Torenvliet. Bounded reductions. In K. Ambos-Spies, S. Homer, and U. Sch\u00f6ning, editors, Complexity Theory, pages 83\u201399. Cambridge University Press, 1993."},{"key":"44_CR4","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0304-3975(75)90016-X","volume":"1","author":"R. Ladner","year":"1975","unstructured":"R. Ladner, N. Lynch, and A. Selman. A comparison of polynomial-time reducibilities. Theoretical Computer Science\n                1, 103\u2013123, 1975.","journal-title":"Theoretical Computer Science"},{"key":"44_CR5","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0304-3975(87)90132-0","volume":"54","author":"O. Watanabe","year":"1987","unstructured":"O. Watanabe. A comparison of polynomial time completeness notions. Theoretical Computer Science\n                54, 249\u2013265, 1987.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1998"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055797","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,11]],"date-time":"2019-02-11T18:04:40Z","timestamp":1549908280000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055797"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648277","9783540685326"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/bfb0055797","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}