{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:02Z","timestamp":1759639082724},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1979,1,1]],"date-time":"1979-01-01T00:00:00Z","timestamp":283996800000},"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":12616,"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":[[1979]]},"DOI":"10.1016\/0304-3975(79)90043-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"177-187","source":"Crossref","is-referenced-by-count":74,"title":["A second step toward the polynomial hierarchy"],"prefix":"10.1016","volume":"8","author":[{"given":"Theodore P.","family":"Baker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan L.","family":"Selman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(79)90043-4_BIB1","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(79)90043-4_BIB2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1090\/S0002-9947-1943-0007371-8","article-title":"Recursive predicates and quantifiers","volume":"53","author":"Kleene","year":"1943","journal-title":"Trans. Am. Math. Soc."},{"key":"10.1016\/0304-3975(79)90043-4_BIB3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1109\/SWAT.1972.29","article-title":"The equivalence problem for regular expressions with squaring requires exponential space","author":"Meyer","year":"1972","journal-title":"Proc. 13th IEEE Symp. Switch. Autom. Theory"},{"key":"10.1016\/0304-3975(79)90043-4_BIB4","doi-asserted-by":"crossref","first-page":"1","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(79)90043-4_BIB5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-3975(76)90062-1","article-title":"Complete sets and the polynomial hierarchy","volume":"3","author":"Wrathall","year":"1976","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900434?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900434?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:23:24Z","timestamp":1555125804000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397579900434"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1979]]}},"alternative-id":["0304397579900434"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(79)90043-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1979]]}}}