{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:56:57Z","timestamp":1725544617559},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540323013"},{"type":"electronic","value":"9783540322887"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11672142_18","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T03:27:54Z","timestamp":1141097274000},"page":"230-241","source":"Crossref","is-referenced-by-count":7,"title":["Oblivious Symmetric Alternation"],"prefix":"10.1007","author":[{"given":"Venkatesan T.","family":"Chakaravarthy","sequence":"first","affiliation":[]},{"given":"Sambuddha","family":"Roy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Fortnow, L.: Two queries. Journal of Computer and System Sciences\u00a059(2) (1999)","DOI":"10.1006\/jcss.1999.1647"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Fortnow, L., Thierauf, T.: Nonrelativizing separations. In: CCC (1998)","DOI":"10.1109\/CCC.1998.694585"},{"key":"18_CR3","unstructured":"Cai, J.: $\\rm {S}_2^{\\it p} \\subseteq {ZPP}^{{NP}}$ . In: FOCS (2001)"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/3-540-36494-3_47","volume-title":"STACS 2003","author":"J. Cai","year":"2003","unstructured":"Cai, J., Chakaravarthy, V., Hemaspaandra, L., Ogihara, M.: Competing provers yield improved Karp\u2013Lipton collapse results. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 535\u2013546. Springer, Heidelberg (2003)"},{"issue":"5","key":"18_CR5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0020-0190(96)00016-6","volume":"57","author":"R. Canetti","year":"1996","unstructured":"Canetti, R.: More on BPP and the polynomial-time hierarchy. Information Processing Letters\u00a057(5), 237\u2013241 (1996)","journal-title":"Information Processing Letters"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Fortnow, L., Impagliazzo, R., Kabanets, V., Umans, C.: On the complexity of succinct zero-sum games. In: CCC (2005)","DOI":"10.1109\/CCC.2005.18"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Fortnow, L., Pavan, A., Sengupta, S.: Proving SAT does not have small circuits with an application to the two queries problem. In: CCC (2003)","DOI":"10.1109\/CCC.2003.1214433"},{"key":"18_CR8","unstructured":"Goldreich, O. Zuckerman, D.: Another proof that BPP \u2286 PH (and more). Technical Report TR97\u2013045, ECCC (1997)"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Hemaspaandra, E., Hemaspaandra, L., Hempel, H.: What\u2019s up with downward collapse: Using the easy-hard technique to link boolean and polynomial hierarchy collapses. Technical Report TR-682, University of Rochester (1998)","DOI":"10.1145\/300307.300308"},{"issue":"2","key":"18_CR10","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1142\/S012905419500010X","volume":"6","author":"V. Arvind","year":"1995","unstructured":"Arvind, V., K\u00f6bler, J., Schuler, R.: On Helping and Interactive Proof Systems. International Journal of Foundations of Computer Science\u00a06(2), 137\u2013153 (1995)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Kabanets, V., Impagliazzo, R.: Derandomizing polynomial identity tests means proving circuit lower bounds. In: STOC (2003)","DOI":"10.1145\/780542.780595"},{"issue":"6","key":"18_CR12","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 Journal on Computing\u00a017(6), 1263\u20131282 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/S0019-9958(82)90382-5","volume":"55","author":"R. Kannan","year":"1982","unstructured":"Kannan, R.: Circuit-size lower bounds and non-reducibility to sparse sets. Information and Control\u00a055, 40\u201356 (1982)","journal-title":"Information and Control"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Karp, R., Lipton, R.: Some connections between nonuniform and uniform complexity classes. In: STOC (1980)","DOI":"10.1145\/800141.804678"},{"issue":"1","key":"18_CR15","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1137\/S0097539795296206","volume":"28","author":"J. K\u00f6bler","year":"1998","unstructured":"K\u00f6bler, J., Watanabe, O.: New collapse consequences of NP having small circuits. SIAM Journal on Computing\u00a028(1), 311\u2013324 (1998)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"18_CR16","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/s000370050007","volume":"7","author":"A. Russell","year":"1998","unstructured":"Russell, A., Sundaram, R.: Symmetric alternation captures BPP. Computational Complexity\u00a07(2), 152\u2013162 (1998)","journal-title":"Computational Complexity"},{"key":"18_CR17","unstructured":"Selman, A., Sengupta, S.: Polylogarithmic-round interactive protocols for coNP collapse the exponential hierarchy. In: CCC (2004)"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Shaltiel, R., Umans, C.: Pseudorandomness for approximate counting and sampling. In: CCC (2005)","DOI":"10.1109\/CCC.2005.26"},{"issue":"3","key":"18_CR19","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0304-3975(83)90020-8","volume":"26","author":"C. Yap","year":"1983","unstructured":"Yap, C.: Some consequences of non-uniform conditions on uniform classes. Theoretical Computer Science\u00a026(3), 287\u2013300 (1983)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","STACS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11672142_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T23:31:35Z","timestamp":1555457495000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11672142_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540323013","9783540322887"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11672142_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}