{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T18:08:06Z","timestamp":1648577286787},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7777,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1992,4]]},"DOI":"10.1016\/0022-0000(92)90018-e","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"168-192","source":"Crossref","is-referenced-by-count":0,"title":["The complexity types of computable sets"],"prefix":"10.1016","volume":"44","author":[{"given":"Wolfgang","family":"Maass","sequence":"first","affiliation":[]},{"given":"Theodore A.","family":"Slaman","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(92)90018-E_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0022-0000(92)90018-E_BIB2","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","article-title":"A machine-independent theory of the complexity of recursive functions","volume":"14","author":"Blum","year":"1967","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(92)90018-E_BIB3","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/S0022-0000(73)80029-7","article-title":"Time-bounded random access machines","volume":"7","author":"Cook","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(92)90018-E_BIB4","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1080\/00207168208803302","article-title":"Linear time transformations between combinatorial problems","volume":"11","author":"Dewdney","year":"1982","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/0022-0000(92)90018-E_BIB5","series-title":"Proceedings, 4th Annual Symposium on Theoretical Aspects of Computer Science","first-page":"125","article-title":"A hierarchy theorem for almost everywhere complex sets with applications to polynomial complexity degrees","volume":"Vol. 247","author":"Geske","year":"1987"},{"key":"10.1016\/0022-0000(92)90018-E_BIB6","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1145\/321650.321661","article-title":"An overview of the theory of computational complexity","volume":"18","author":"Hartmanis","year":"1971","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(92)90018-E_BIB7","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1145\/321864.321877","article-title":"On the structure of polynomial-time reducibility","volume":"22","author":"Ladner","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(92)90018-E_BIB8","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(81)90069-4","article-title":"On the structure of sets in NP and other classes","volume":"15","author":"Landweber","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(92)90018-E_BIB9","series-title":"Degrees of Unsolvability","author":"Lerman","year":"1983"},{"key":"10.1016\/0022-0000(92)90018-E_BIB10","first-page":"1464","article-title":"On storage capacity for algorithms","volume":"14","author":"Levin","year":"1973","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0022-0000(92)90018-E_BIB11","doi-asserted-by":"crossref","first-page":"555","DOI":"10.2307\/2271779","article-title":"Helping: Several formalizations","volume":"40","author":"Lynch","year":"1975","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0022-0000(92)90018-E_BIB12","series-title":"Proc. of the 4th Annual Conf. on Structure in Complexity Theory","first-page":"231","article-title":"The complexity types of computable sets (extended abstract)","author":"Maass","year":"1989"},{"key":"10.1016\/0022-0000(92)90018-E_BIB13","series-title":"Proceedings, 7th Int. Conf. on Fundamentals of Computation Theory","first-page":"318","article-title":"Extensional properties of sets of time bounded complexity (extended abstract)","volume":"Vol. 380","author":"Maass","year":"1989"},{"key":"10.1016\/0022-0000(92)90018-E_BIB14","series-title":"An Introduction to the General Theory of Algorithms","author":"Machtey","year":"1978"},{"key":"10.1016\/0022-0000(92)90018-E_BIB15","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(82)90002-2","article-title":"Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis","volume":"25","author":"Mahaney","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(92)90018-E_BIB16","doi-asserted-by":"crossref","first-page":"55","DOI":"10.2307\/2272545","article-title":"Computational speed-up by effective operators","volume":"37","author":"Meyer","year":"1972","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0022-0000(92)90018-E_BIB17","first-page":"97","article-title":"The fundamental theorem of complexity theory","volume":"108","author":"Meyer","year":"1979","journal-title":"Math. Centre Tracts"},{"key":"10.1016\/0022-0000(92)90018-E_BIB18","series-title":"Komplexitaetsthcorie","author":"Paul","year":"1978"},{"key":"10.1016\/0022-0000(92)90018-E_BIB19","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1002\/malq.19750210106","article-title":"A characterization of complexity sequences","volume":"21","author":"Schnorr","year":"1975","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/0022-0000(92)90018-E_BIB20","series-title":"Proceedings, of Structure in Complexity Theory","first-page":"252","article-title":"On the theory of the PTIME degrees of the recursive set","author":"Shinoda","year":"1988"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009290018E?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009290018E?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:57:02Z","timestamp":1550325422000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009290018E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["002200009290018E"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(92)90018-e","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}