{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T21:13:23Z","timestamp":1672694003588},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"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":11885,"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":[[1981]]},"DOI":"10.1016\/0304-3975(81)90062-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"41-50","source":"Crossref","is-referenced-by-count":30,"title":["Bounded query machines: On NP() and NPQUERY()"],"prefix":"10.1016","volume":"15","author":[{"given":"Ronald V.","family":"Book","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Celia","family":"Wrathall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(81)90062-1_BIB1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0304-3975(80)90027-4","article-title":"On counting problems and the polynomial-time hierarchy","volume":"12","author":"Angluin","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(81)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(81)90062-1_BIB3","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0304-3975(79)90043-4","article-title":"A second step towards the polynomial time hierarchy","volume":"8","author":"Baker","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(81)90062-1_BIB4","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF00266049","article-title":"On languages accepted by space-bounded oracle machines","volume":"12","author":"Book","year":"1979","journal-title":"Acta Informat."},{"key":"10.1016\/0304-3975(81)90062-1_BIB5","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(81)90061-X","article-title":"Bounded query machines: on NP and PSPACE","volume":"15","author":"Book","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(81)90062-1_BIB6","unstructured":"R. Book, Time, space, and relativizations, in preparation."},{"key":"10.1016\/0304-3975(81)90062-1_BIB7","series-title":"Studies in Abstract Families of Languages","first-page":"41","article-title":"Pre-AFL","author":"Ginsburg","year":"1969"},{"key":"10.1016\/0304-3975(81)90062-1_BIB8","first-page":"185","article-title":"A comparison of polynomial time reducibilities","volume":"7","author":"Ladner","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(81)90062-1_BIB9","unstructured":"D. Rosenkrantz and R. Stearns, A lattice of reducibilities, manuscript."},{"key":"10.1016\/0304-3975(81)90062-1_BIB10","first-page":"186","article-title":"Polynomial reducibilities and upwards diagonalizations","author":"Simon","year":"1977","journal-title":"Proc. 9th ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(81)90062-1_BIB11","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(81)90062-1_BIB12","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1016\/S0022-0000(69)80032-2","article-title":"A generator of context-sensitive languages","volume":"3","author":"Wegbreit","year":"1969","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(81)90062-1_BIB13","series-title":"Ph.D. dissertation","article-title":"Subrecursive predicates and automata","author":"Wrathall","year":"1975"},{"key":"10.1016\/0304-3975(81)90062-1_BIB14","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-3975(76)90062-1","article-title":"Complete sets and the polynomial-time hierarchy","volume":"3","author":"Wrathall","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(81)90062-1_BIB15","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1137\/0207018","article-title":"Rudimentary predicates and relative computation","volume":"7","author":"Wrathall","year":"1976","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397581900621?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397581900621?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:25:32Z","timestamp":1555111532000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397581900621"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981]]}},"alternative-id":["0304397581900621"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(81)90062-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1981]]}}}