{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:29:36Z","timestamp":1725560976816},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206804"},{"type":"electronic","value":"9783540245971"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24597-1_32","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T07:39:20Z","timestamp":1280389160000},"page":"375-386","source":"Crossref","is-referenced-by-count":2,"title":["Quantum and Classical Complexity Classes: Separations, Collapses, and Closure Properties"],"prefix":"10.1007","author":[{"given":"Holger","family":"Spakowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mayur","family":"Thakur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahul","family":"Tripathi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"32_CR1","doi-asserted-by":"publisher","first-page":"1524","DOI":"10.1137\/S0097539795293639","volume":"26","author":"L. Adleman","year":"1997","unstructured":"Adleman, L., DeMarrais, J., Huang, M.: Quantum computability. SIAM Journal on Computing\u00a026(5), 1524\u20131540 (1997)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"32_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(92)90084-S","volume":"103","author":"R. Beigel","year":"1992","unstructured":"Beigel, R., Gill, J.: Counting classes: Thresholds, parity, mods, and fewness. Theoretical. Computer Science\u00a0103(1), 3\u201323 (1992)","journal-title":"Theoretical. Computer Science"},{"issue":"5","key":"32_CR3","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1137\/S0097539796300933","volume":"26","author":"C. Bennett","year":"1997","unstructured":"Bennett, C., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing. SIAM Journal on Computing\u00a026(5), 1510\u20131523 (1997)","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"32_CR4","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1137\/S0097539796300921","volume":"26","author":"E. Bernstein","year":"1997","unstructured":"Bernstein, E., Vazirani, U.: Quantum complexity theory. SIAM Journal on Computing\u00a026(5), 1411\u20131473 (1997)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"32_CR5","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0304-3975(92)90125-Y","volume":"104","author":"D. Bovet","year":"1992","unstructured":"Bovet, D., Crescenzi, P., Silvestri, R.: A uniform approach to define complexity classes. Theoretical Computer Science\u00a0104(2), 263\u2013283 (1992)","journal-title":"Theoretical Computer Science"},{"issue":"4-5","key":"32_CR6","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","volume":"46","author":"M. Boyer","year":"1998","unstructured":"Boyer, M., Brassard, G., H\u00f8yer, P., Tapp, A.: Tight bounds on quantum searching. Fortschritte der Physik\u00a046(4-5), 493\u2013506 (1998)","journal-title":"Fortschritte der Physik"},{"issue":"2","key":"32_CR7","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0304-3975(92)90232-5","volume":"102","author":"D. Bruschi","year":"1992","unstructured":"Bruschi, D.: Strong separations of the polynomial hierarchy with oracles: Constructive separations by immune and simple sets. Theoretical Computer Science\u00a0102(2), 215\u2013252 (1992)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"32_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1142\/S0129054190000151","volume":"1","author":"D. Bruschi","year":"1990","unstructured":"Bruschi, D., Joseph, D., Young, P.: Strong separations for the boolean hierarchy over RP. International Journal of Foundations of Computer Science\u00a01(3), 201\u2013218 (1990)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"2","key":"32_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02090768","volume":"23","author":"J. Cai","year":"1990","unstructured":"Cai, J., Hemachandra, L.: On the power of parity polynomial time. Mathematical Systems Theory\u00a023(2), 95\u2013106 (1990)","journal-title":"Mathematical Systems Theory"},{"key":"32_CR10","unstructured":"de Graaf, M., Valiant, P.: Comparing EQP and $\\rm MOD_{p^{k}}$ P using polynomial degree lower bounds. Technical Report quant-ph\/0211179, Quantum Physics (2002)"},{"issue":"2","key":"32_CR11","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s00224-002-1089-8","volume":"36","author":"S. Fenner","year":"2003","unstructured":"Fenner, S.: PP-lowness and a simple definition of AWPP. Theory of Computing Systems\u00a036(2), 199\u2013212 (2003)","journal-title":"Theory of Computing Systems"},{"issue":"1","key":"32_CR12","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/S0022-0000(05)80024-8","volume":"48","author":"S. Fenner","year":"1994","unstructured":"Fenner, S., Fortnow, L., Kurtz, S.: Gap-definable counting classes. Journal of Computer and System Sciences\u00a048(1), 116\u2013148 (1994)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"32_CR13","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0890-5401(03)00018-X","volume":"182","author":"S. Fenner","year":"2003","unstructured":"Fenner, S., Fortnow, L., Kurtz, S., Li, L.: An oracle builder\u2019s toolkit. Information and Computation\u00a0182(2), 95\u2013136 (2003)","journal-title":"Information and Computation"},{"key":"32_CR14","first-page":"241","volume-title":"Proceedings of the 6th Italian Conference for Theoretical Computer Science","author":"S. Fenner","year":"1998","unstructured":"Fenner, S., Green, F., Homer, S., Pruim, R.: Quantum NP is hard for PH. In: Proceedings of the 6th Italian Conference for Theoretical Computer Science, pp. 241\u2013252. World Scientific, Singapore (1998)"},{"issue":"6","key":"32_CR15","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S0020-0190(99)00034-4","volume":"69","author":"L. Fortnow","year":"1999","unstructured":"Fortnow, L.: Relativized worlds with an infinite hierarchy. Information Processing Letters\u00a069(6), 309\u2013313 (1999)","journal-title":"Information Processing Letters"},{"issue":"2","key":"32_CR16","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1006\/jcss.1999.1651","volume":"59","author":"L. Fortnow","year":"1999","unstructured":"Fortnow, L., Rogers, J.: Complexity limitations on quantum computation. Journal of Computer and System Sciences\u00a059(2), 240\u2013252 (1999)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"32_CR17","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1137\/0206049","volume":"6","author":"J. Gill","year":"1977","unstructured":"Gill, J.: Computational complexity of probabilistic Turing machines. SIAM Journal on Computing\u00a06(4), 675\u2013695 (1977)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"32_CR18","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0304-3975(86)90165-9","volume":"43","author":"L. Goldschlager","year":"1986","unstructured":"Goldschlager, L., Parberry, I.: On the construction of parallel computers from various bases of boolean functions. Theoretical Computer Science\u00a043(1), 43\u201358 (1986)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"32_CR19","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01202284","volume":"26","author":"F. Green","year":"1993","unstructured":"Green, F.: On the power of deterministic reductions to C=P. Mathematical Systems Theory\u00a026(2), 215\u2013233 (1993)","journal-title":"Mathematical Systems Theory"},{"key":"32_CR20","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0020-0190(01)00176-4","volume":"80","author":"F. Green","year":"2001","unstructured":"Green, F., Pruim, R.: Relativized separation of EQP from P NP . Information Processing Letters\u00a080, 257\u2013260 (2001)","journal-title":"Information Processing Letters"},{"key":"32_CR21","volume-title":"Quantum Computing","author":"J. Gruska","year":"1999","unstructured":"Gruska, J.: Quantum Computing. McGraw-Hill, New York (1999)"},{"key":"32_CR22","first-page":"653","volume-title":"Proceedings of the 34th ACM Symposium on Theory of Computing","author":"S. Hallgren","year":"2002","unstructured":"Hallgren, S.: Polynomial-time quantum algorithms for Pell\u2019s equation and principal ideal problem. In: Proceedings of the 34th ACM Symposium on Theory of Computing, pp. 653\u2013658. ACM Press, NewYork (2002)"},{"key":"32_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04880-1","volume-title":"The Complexity Theory Companion","author":"L. Hemaspaandra","year":"2002","unstructured":"Hemaspaandra, L., Ogihara, M.: The Complexity Theory Companion. Springer, Heidelberg (2002)"},{"issue":"3","key":"32_CR24","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0304-3975(90)90081-R","volume":"74","author":"U. Hertrampf","year":"1990","unstructured":"Hertrampf, U.: Relations among MOD-classes. Theoretical Computer Science\u00a074(3), 325\u2013328 (1990)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"32_CR25","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1051\/ita\/1990240302291","volume":"24","author":"K. Ko","year":"1990","unstructured":"Ko, K.: A note on separating the relativized polynomial-time hierarchy by immune sets. RAIRO Theoretical Informatics and Applications\u00a024(3), 229\u2013240 (1990)","journal-title":"RAIRO Theoretical Informatics and Applications"},{"issue":"2","key":"32_CR26","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/0022-0000(92)90022-B","volume":"44","author":"J. K\u00f6bler","year":"1992","unstructured":"K\u00f6bler, J., Sch\u00f6ning, U., Toda, S., Tor\u00e1n, J.: Turing machines with few accepting computations and low sets for PP. Journal of Computer and System Sciences\u00a044(2), 272\u2013286 (1992)","journal-title":"Journal of Computer and System Sciences"},{"key":"32_CR27","unstructured":"Li, L.: On PP-low classes. Technical Report TR-93-03, Department of Computer Science, University of Chicago (May 14, 1993)"},{"key":"32_CR28","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. CUP (2000)"},{"issue":"3","key":"32_CR29","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0022-0000(93)90006-I","volume":"46","author":"M. Ogiwara","year":"1993","unstructured":"Ogiwara, M., Hemachandra, L.: A complexity theory for feasible closure properties. Journal of Computer and System Sciences\u00a046(3), 295\u2013325 (1993)","journal-title":"Journal of Computer and System Sciences"},{"key":"32_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BFb0009651","volume-title":"Theoretical Computer Science","author":"C. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C., Zachos, S.: Two remarks on the power of counting. In: Cremers, A.B., Kriegel, H.-P. (eds.) GI-TCS 1983. LNCS, vol.\u00a0145, pp. 269\u2013276. Springer, Heidelberg (1982)"},{"key":"32_CR31","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1215\/ijm\/1255631807","volume":"6","author":"J. Rosser","year":"1962","unstructured":"Rosser, J., Schoenfeld, L.: Approximate formulas for some functions of prime numbers. Illinois Journal of Mathematics\u00a06, 64\u201394 (1962)","journal-title":"Illinois Journal of Mathematics"},{"issue":"2","key":"32_CR32","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1051\/ita:1999100","volume":"33","author":"J. Rothe","year":"1999","unstructured":"Rothe, J.: Immunity and simplicity for exact counting and other counting classes. RAIRO Theoretical Informatics and Applications\u00a033(2), 159\u2013176 (1999)","journal-title":"RAIRO Theoretical Informatics and Applications"},{"issue":"5","key":"32_CR33","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P. Shor","year":"1997","unstructured":"Shor, P.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing\u00a026(5), 1484\u20131509 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"32_CR34","doi-asserted-by":"crossref","unstructured":"Spakowski, H., Thakur, M., Tripathi, R.: Quantum and classical complexity classes: Separations, collapses, and closure properties. Technical Report TR801, Department of Computer Science, University of Rochester (June 2003)","DOI":"10.1007\/978-3-540-24597-1_32"},{"key":"32_CR35","first-page":"285","volume-title":"Proceedings of the 6th Annual Conference on Structure in Complexity Theory (SCTC 1991)","author":"J. Tarui","year":"1991","unstructured":"Tarui, J.: Degree complexity of boolean functions and its applications to relativized separations. In: Proceedings of the 6th Annual Conference on Structure in Complexity Theory (SCTC 1991), Chicago, IL, USA, June 1991, pp. 285\u2013285. IEEE Computer Society Press, Chicago (1991)"},{"issue":"5","key":"32_CR36","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1137\/0220053","volume":"20","author":"S. Toda","year":"1991","unstructured":"Toda, S.: PP is as hard as the polynomial-time hierarchy. SIAM Journal on Computing\u00a020(5), 865\u2013877 (1991)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"32_CR37","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/116825.116858","volume":"38","author":"J. Tor\u00e1n","year":"1991","unstructured":"Tor\u00e1n, J.: Complexity classes defined by counting quantifiers. Journal of the ACM\u00a038(3), 753\u2013774 (1991)","journal-title":"Journal of the ACM"},{"key":"32_CR38","unstructured":"Vyalyi, M.: QMA = PP implies that PP contains PH. In ECCCTR: Electronic Colloquium on Computational Complexity, technical reports (2003)"},{"issue":"2","key":"32_CR39","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0020-0190(99)00084-8","volume":"71","author":"T. Yamakami","year":"1999","unstructured":"Yamakami, T., Yao, A.: NQP C = co-C=P. Information Processing Letters\u00a071(2), 63\u201369 (1999)","journal-title":"Information Processing Letters"},{"issue":"3","key":"32_CR40","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/0022-0000(88)90037-2","volume":"36","author":"S. Zachos","year":"1988","unstructured":"Zachos, S.: Probabilistic quantifiers and games. Journal of Computer and System Sciences\u00a036(3), 433\u2013451 (1988)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24597-1_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T06:54:46Z","timestamp":1635836086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24597-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206804","9783540245971"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24597-1_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}