{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T11:51:05Z","timestamp":1648554665106},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1976,8,1]],"date-time":"1976-08-01T00:00:00Z","timestamp":207705600000},"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":13499,"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":[[1976,8]]},"DOI":"10.1016\/s0022-0000(76)80054-2","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T04:46:40Z","timestamp":1289364400000},"page":"100-118","source":"Crossref","is-referenced-by-count":0,"title":["Complexity-class-encoding sets"],"prefix":"10.1016","volume":"13","author":[{"given":"Nancy","family":"Lynch","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(76)80054-2_bib1","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","article-title":"A machine-independent theory of the complexity of recursive functions","author":"Blum","year":"1967","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(76)80054-2_bib2","series-title":"Conf. Rec. Third ACM Symposium on Theory, of Computing","first-page":"151","article-title":"The complecity of theorem-proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/S0022-0000(76)80054-2_bib3","article-title":"Super-exponential complexity of Presburger arithmetic","volume":"Vol. 43","author":"Fischer","year":"1974","journal-title":"Project Mac TM"},{"key":"10.1016\/S0022-0000(76)80054-2_bib4","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1145\/321650.321661","article-title":"An overview of the theory of computational complexity","author":"Hartmanis","year":"1971","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(76)80054-2_bib5","author":"Hopcroft","year":"1969"},{"key":"10.1016\/S0022-0000(76)80054-2_bib6","series-title":"Complexity of Computer Computations","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"issue":"No. 57","key":"10.1016\/S0022-0000(76)80054-2_bib7","article-title":"Complexity-class-encoding sets","author":"Lynch","year":"1974","journal-title":"USC Department of Mathematics, Preprint"},{"key":"10.1016\/S0022-0000(76)80054-2_bib8","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/321892.321895","article-title":"On reducibility to complex or sparse sets","author":"Lynch","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(76)80054-2_bib9","unstructured":"R. Ladner, N. Lynch, and A. Selman, A comparison of polynomial-time reducibilites,TCS, to appear."},{"key":"10.1016\/S0022-0000(76)80054-2_bib10","unstructured":"N. Lynch, A. Meyer, and M. Fischer, Relativization of the theory of computationalcomplexity, Trans. Amer. Math. Soc., to appear."},{"key":"10.1016\/S0022-0000(76)80054-2_bib11","unstructured":"A. Meyer, Personal communication."},{"key":"10.1016\/S0022-0000(76)80054-2_bib12","unstructured":"E. McCreight and M. Meyer, Computationally complex and pseudo-random, zero-one valued functions."},{"key":"10.1016\/S0022-0000(76)80054-2_bib13","series-title":"SWAT Conference Record","article-title":"The equivalence problem for regular expressions with squaring requires exponential space","author":"Meyer","year":"1972"},{"key":"10.1016\/S0022-0000(76)80054-2_bib14","author":"Rogers","year":"1967"},{"key":"10.1016\/S0022-0000(76)80054-2_bib15","article-title":"On sets Cook-reducible to sparse sets","author":"Solovay","year":"1975","journal-title":"IBM RC 5215"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000076800542?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000076800542?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T18:54:22Z","timestamp":1544122462000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000076800542"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,8]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1976,8]]}},"alternative-id":["S0022000076800542"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(76)80054-2","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1976,8]]}}}