{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:31:21Z","timestamp":1725798681244},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662444641"},{"type":"electronic","value":"9783662444658"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44465-8_51","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T06:33:02Z","timestamp":1407825182000},"page":"601-612","source":"Crossref","is-referenced-by-count":0,"title":["The Two Queries Assumption and Arthur-Merlin Classes"],"prefix":"10.1007","author":[{"given":"Vyas Ram","family":"Selvam","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"51_CR1","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF01371729","volume":"26","author":"R. Beigel","year":"1993","unstructured":"Beigel, R., Chang, R., Ogiwara, M.: A relationship between difference hierarchies and relativized polynomial hierarchies. Mathematical Systems Theory\u00a026(3), 293\u2013310 (1993)","journal-title":"Mathematical Systems Theory"},{"key":"51_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/3-540-36494-3_48","volume-title":"STACS 2003","author":"H. Buhrman","year":"2003","unstructured":"Buhrman, H., Chang, R., Fortnow, L.: One Bit of Advice. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 547\u2013558. Springer, Heidelberg (2003)"},{"issue":"2","key":"51_CR3","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1006\/jcss.1999.1647","volume":"59","author":"H. Buhrman","year":"1999","unstructured":"Buhrman, H., Fortnow, L.: Two Queries. J. Comput. Syst. Sci.\u00a059(2), 182\u2013194 (1999)","journal-title":"J. Comput. Syst. Sci."},{"key":"51_CR4","doi-asserted-by":"crossref","unstructured":"Cai, J., Chakaravarthy, V.: A note on zero error algorithms having oracle access to one NP query. In: Proceedings of the 11th Annual International Conference on Computing and Combinatorics, pp. 339\u2013348 (2005)","DOI":"10.1007\/11533719_35"},{"key":"51_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/11672142_18","volume-title":"STACS 2006","author":"V.T. Chakaravarthy","year":"2006","unstructured":"Chakaravarthy, V.T., Roy, S.: Oblivious Symmetric Alternation. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 230\u2013241. Springer, Heidelberg (2006)"},{"issue":"2","key":"51_CR6","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1137\/S0097539790178069","volume":"25","author":"R. Chang","year":"1996","unstructured":"Chang, R., Kadin, J.: The Boolean Hierarchy and the Polynomial Hierarchy: A closer connection. SIAM J. Comput.\u00a025(2), 340\u2013354 (1996)","journal-title":"SIAM J. Comput."},{"key":"51_CR7","first-page":"52","volume-title":"Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity, CCC 2007","author":"R. Chang","year":"2007","unstructured":"Chang, R., Purini, S.: Bounded Queries and the NP Machine Hypothesis. In: Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity, CCC 2007, pp. 52\u201359. IEEE Computer Society, Washington, DC (2007)"},{"key":"51_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/CCC.2008.32","volume-title":"Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity, CCC 2008","author":"R. Chang","year":"2008","unstructured":"Chang, R., Purini, S.: Amplifying ZPP^SAT[1] and the Two Queries Problem. In: Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity, CCC 2008, pp. 41\u201352. IEEE Computer Society Press, Washington, DC (2008)"},{"issue":"3","key":"51_CR9","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/j.jcss.2007.06.017","volume":"74","author":"L. Fortnow","year":"2008","unstructured":"Fortnow, L., Pavan, A., Sengupta, S.: Proving SAT does not have small circuits with an application to the two queries problem. J. Comput. Syst. Sci.\u00a074(3), 358\u2013363 (2008)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"51_CR10","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1137\/S0097539796306474","volume":"28","author":"E. Hemaspaandra","year":"1999","unstructured":"Hemaspaandra, E., Hemaspaandra, L.A., Hempel, H.: A Downward Collapse within the Polynomial Hierarchy. SIAM Journal on Computing\u00a028(2), 383\u2013393 (1999)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"51_CR11","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1137\/0217080","volume":"17","author":"J. Kadin","year":"1988","unstructured":"Kadin, J.: The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses. SIAM J. Comput.\u00a017(6), 1263\u20131282 (1988)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"51_CR12","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1016\/0022-0000(88)90039-6","volume":"36","author":"M.W. Krentel","year":"1988","unstructured":"Krentel, M.W.: The Complexity of Optimization Problems. J. Comput. Syst. Sci.\u00a036(3), 490\u2013509 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"51_CR13","doi-asserted-by":"crossref","unstructured":"Wagner, K.W.: Bounded query computations. In: Proceedings of the Third Annual Structure in Complexity Theory Conference, pp. 260\u2013277 (June 1988)","DOI":"10.1109\/SCT.1988.5286"},{"key":"51_CR14","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0304-3975(83)90020-8","volume":"26","author":"C.-K. Yap","year":"1983","unstructured":"Yap, C.-K.: Some Consequences of Non-Uniform Conditions on Uniform Classes. Theor. Comput. Sci.\u00a026, 287\u2013300 (1983)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44465-8_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T11:17:17Z","timestamp":1558955837000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44465-8_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662444641","9783662444658"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44465-8_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}