{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:10Z","timestamp":1725664510493},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540620341"},{"type":"electronic","value":"9783540496311"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-62034-6_60","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:32:04Z","timestamp":1330295524000},"page":"322-334","source":"Crossref","is-referenced-by-count":2,"title":["Pinpointing computation with modular queries in the Boolean hierarchy"],"prefix":"10.1007","author":[{"given":"Manindra","family":"Agrawal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Beigel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Thierauf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"J. Balc\u00e1zar, J. D\u00edaz, and J. Gabarr\u00f3. Structural Complexity I. EATCS Monographs in Theoretical Computer Science. Springer-Verlag, 1988.","DOI":"10.1007\/978-3-642-97062-7"},{"key":"28_CR2","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0304-3975(91)90160-4","volume":"84","author":"R. Beigel","year":"1991","unstructured":"R. Beigel. Bounded queries to SAT and the boolean hierarchy. Theoretical Computer Science, 84:199\u2013223, 1991.","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"28_CR3","doi-asserted-by":"crossref","first-page":"1232","DOI":"10.1137\/0217078","volume":"17","author":"J. Cai","year":"1988","unstructured":"J. Cai, T. Gundermann, J. Hartmanis, L. Hemachandra, V. Sewelson, K. Wagner, and G. Wechsung. The boolean hierarchy I: Structural properties. SIAM Journal on Computing, 17(6): 1232\u20131252, 1988.","journal-title":"SIAM Journal on Computing"},{"key":"28_CR4","unstructured":"T. Han and T. Thierauf. In Proceedings of the 10th Conference in Structure in Complexity Theory, pages 206\u2013213, 1995."},{"key":"28_CR5","unstructured":"J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979."},{"issue":"4","key":"28_CR6","first-page":"419","volume":"21","author":"J. K\u00f6bler","year":"1987","unstructured":"J. K\u00f6bler, U. Sch\u00f6ning, and K. Wagner. The difference and truthtable hierarchies of NP. R.A.I.R.O. Informatique th\u00e9orique et Applications, 21(4):419\u2013435, 1987.","journal-title":"R.A.I.R.O. Informatique th\u00e9orique et Applications"},{"issue":"2","key":"28_CR7","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1137\/S0097539791200351","volume":"23","author":"J. K\u00f6bler","year":"1994","unstructured":"J. K\u00f6bler and T. Thierauf. Complexity-restricted advice functions. SIAM Journal on Computing, 23(2):261\u2013275, 1994.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"28_CR8","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0304-3975(75)90016-X","volume":"1","author":"R. Ladner","year":"1975","unstructured":"R. Ladner, N. Lynch, and A. Selman. A comparison of polynomial time reducibilities. Theoretical Computer Science, 1(2):103\u2013124, 1975.","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"28_CR9","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1137\/0219058","volume":"19","author":"K. Wagner","year":"1990","unstructured":"K. Wagner. Bounded query classes. SIAM J. on Computing 19(5), pages 833\u2013846, 1990.","journal-title":"SIAM J. on Computing"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"G. Wechsung. On the boolean closure of NP. In Proceedings of the 5th Conference on Fundamentals of Computation Theory, pages 485\u2013493. Springer-Verlag Lecture Notes in Computer Science #199, 1985. (An unpublished precursor of this paper was coauthored by K. Wagner).","DOI":"10.1007\/BFb0028832"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62034-6_60.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:11:41Z","timestamp":1605647501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62034-6_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540620341","9783540496311"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-62034-6_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}