{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T05:15:13Z","timestamp":1774588513645,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642385353","type":"print"},{"value":"9783642385360","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38536-0_29","type":"book-chapter","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T01:03:04Z","timestamp":1370221384000},"page":"334-346","source":"Crossref","is-referenced-by-count":5,"title":["Quantum Alternation"],"prefix":"10.1007","author":[{"given":"Abuzer","family":"Yakary\u0131lmaz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511804090"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Babai, L.: Trading group theory for randomness. In: STOC 1985: Proceedings of the 17th Annual ACM Symposium on Theory of Computing, pp. 421\u2013429 (1985)","DOI":"10.1145\/22145.22192"},{"issue":"2","key":"29_CR3","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1006\/jcss.2002.1852","volume":"65","author":"P. Berman","year":"2002","unstructured":"Berman, P., Karpinski, M., Larmore, L.L., Plandowski, W., Ryttere, W.: On the complexity of pattern matching for highly compressed two-dimensional texts. Journal of Computer and System Sciences\u00a065(2), 332\u2013350 (2002)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"29_CR4","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A.K. Chandra","year":"1981","unstructured":"Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. Journal of the ACM\u00a028(1), 114\u2013133 (1981)","journal-title":"Journal of the ACM"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Chandra, A.K., Stockmeyer, L.J.: Alternation. In: FOCS 1976: Proceedings of the 17th IEEE Symposium on Foundations of Computer Science, pp. 98\u2013108 (1976)","DOI":"10.1109\/SFCS.1976.4"},{"key":"29_CR6","unstructured":"Condon, A.: Computational Models of Games. MIT Press (1989)"},{"key":"29_CR7","first-page":"241","volume-title":"Sixth Italian Conference on Theoretical Computer Science","author":"S. Fenner","year":"1998","unstructured":"Fenner, S., Green, F., Homer, S., Puim, R.: Quantum NP is hard for PH . In: Sixth Italian Conference on Theoretical Computer Science, pp. 241\u2013252. World Scientific, Singapore (1998)"},{"issue":"1","key":"29_CR8","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM Journal on Computing\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Kozen, D.C.: On parallelism in Turing machines. In: FOCS 1976: Proceedings of the 17th IEEE Symposium on Foundations of Computer Science, pp. 89\u201397 (1976)","DOI":"10.1109\/SFCS.1976.20"},{"issue":"3","key":"29_CR10","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0019-9958(71)90373-1","volume":"18","author":"M. Nasu","year":"1971","unstructured":"Nasu, M., Honda, N.: A context-free language which is not acceptable by a probabilistic automaton. Information and Control\u00a018(3), 233\u2013236 (1971)","journal-title":"Information and Control"},{"key":"29_CR11","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press (2000)"},{"issue":"2","key":"29_CR12","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/0022-0000(85)90045-5","volume":"31","author":"C.H. Papadimitriou","year":"1985","unstructured":"Papadimitriou, C.H.: Games against nature. Journal of Computer and System Sciences\u00a031(2), 288\u2013301 (1985)","journal-title":"Journal of Computer and System Sciences"},{"key":"29_CR13","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison Wesley (1994)"},{"key":"29_CR14","volume-title":"Introduction to Probabilistic Automata","author":"A. Paz","year":"1971","unstructured":"Paz, A.: Introduction to Probabilistic Automata. Academic Press, New York (1971)"},{"issue":"2","key":"29_CR15","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0022-0000(84)90034-5","volume":"29","author":"J.H. Reif","year":"1984","unstructured":"Reif, J.H.: The complexity of two-player games of incomplete information. Journal of Computer and System Sciences\u00a029(2), 274\u2013301 (1984)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"29_CR16","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"W.J. Savitch","year":"1970","unstructured":"Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences\u00a04(2), 177\u2013192 (1970)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"29_CR17","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1006\/jcss.1999.1655","volume":"59","author":"J. Watrous","year":"1999","unstructured":"Watrous, J.: Space-bounded quantum complexity. Journal of Computer and System Sciences\u00a059(2), 281\u2013326 (1999)","journal-title":"Journal of Computer and System Sciences"},{"key":"29_CR18","unstructured":"Yakary\u0131lmaz, A.: Public-qubits versus private-coins. Tech. Rep. ECCC:TR12\u2013130 (2012), http:\/\/eccc.hpi-web.de\/report\/2012\/130\/"},{"key":"29_CR19","first-page":"1205","volume":"arXiv","author":"A. Yakary\u0131lmaz","year":"2012","unstructured":"Yakary\u0131lmaz, A.: Turing-equivalent automata using a fixed-size quantum memory. Tech. Rep. arXiv:1205.5395v1 (2012)","journal-title":"Tech. Rep."},{"issue":"9&10","key":"29_CR20","doi-asserted-by":"crossref","first-page":"747","DOI":"10.26421\/QIC10.9-10-3","volume":"10","author":"A. Yakary\u0131lmaz","year":"2010","unstructured":"Yakary\u0131lmaz, A., Say, A.C.C.: Languages recognized by nondeterministic quantum finite automata. Quantum Information and Computation 10(9&10), 747\u2013770 (2010)","journal-title":"Quantum Information and Computation"},{"issue":"2","key":"29_CR21","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0020-0190(99)00084-8","volume":"71","author":"T. Yamakami","year":"1999","unstructured":"Yamakami, T., Yao, A.C.C.: NQP \u2102 = co- C=P. Information Processing Letters 71(2), 63\u201369 (1999)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38536-0_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T18:47:11Z","timestamp":1645642031000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38536-0_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385353","9783642385360"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38536-0_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}