{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,7]],"date-time":"2026-06-07T08:50:22Z","timestamp":1780822222635,"version":"3.54.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1976,10,1]],"date-time":"1976-10-01T00:00:00Z","timestamp":212976000000},"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":13438,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1976,10]]},"DOI":"10.1016\/0304-3975(76)90062-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"23-33","source":"Crossref","is-referenced-by-count":270,"title":["Complete sets and the polynomial-time hierarchy"],"prefix":"10.1016","volume":"3","author":[{"given":"Celia","family":"Wrathall","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(76)90062-1_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(76)90062-1_BIB2","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0204037","article-title":"Relativizations of the P = ?NP question","volume":"4","author":"Baker","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(76)90062-1_BIB3","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1016\/S0022-0000(70)80031-9","article-title":"Time- and tape-bounded Turing acceptors and AFLs","volume":"4","author":"Book","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(76)90062-1_BIB4","series-title":"Proc. 1964 Congress for Logic, Methodology and Philosophy of Science","first-page":"24","article-title":"The intrinsic difficulty of functions","author":"Cobham","year":"1964"},{"key":"10.1016\/0304-3975(76)90062-1_BIB5","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/800157.805047","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971","journal-title":"Proc. Third Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(76)90062-1_BIB6","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/S0022-0000(75)80050-X","article-title":"Space-bounded reducibility among combinatorial problems","volume":"11","author":"Jones","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(76)90062-1_BIB7","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0304-3975(76)90062-1_BIB8","series-title":"Doctoral Thesis","article-title":"Relativization of the theory of computational complexity","author":"Lynch","year":"1972"},{"key":"10.1016\/0304-3975(76)90062-1_BIB9","first-page":"125","article-title":"The equivalence problem for regular expressions with squaring requires exponential space","author":"Meyer","year":"1972","journal-title":"Proc. Thirteenth Annual IEEE Symposium on Switching and Automata Theory"},{"key":"10.1016\/0304-3975(76)90062-1_BIB10","series-title":"Doctoral Thesis","article-title":"Nondeterministic time and space complexity classes","author":"Seiferas","year":"1974"},{"key":"10.1016\/0304-3975(76)90062-1_BIB11","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(76)90062-1_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/800125.804029","article-title":"Word problems requiring exponential time: preliminary report","author":"Stockmeyer","year":"1973","journal-title":"Proc. Fifth Annual Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(76)90062-1_BIB13","series-title":"Report 56","article-title":"Subrecursive predicates and automata","author":"Wrathall","year":"1975"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900621?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900621?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:54:16Z","timestamp":1555077256000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397576900621"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,10]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1976,10]]}},"alternative-id":["0304397576900621"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(76)90062-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1976,10]]}}}