{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:34:38Z","timestamp":1725798878014},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319096971"},{"type":"electronic","value":"9783319096988"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09698-8_29","type":"book-chapter","created":{"date-parts":[[2014,8,17]],"date-time":"2014-08-17T20:52:51Z","timestamp":1408308771000},"page":"327-338","source":"Crossref","is-referenced-by-count":0,"title":["Debates with Small Transparent Quantum Verifiers"],"prefix":"10.1007","author":[{"given":"Abuzer","family":"Yakary\u0131lmaz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. C. Cem","family":"Say","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. G\u00f6kalp","family":"Demirci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"29_CR1","doi-asserted-by":"publisher","first-page":"1524","DOI":"10.1137\/S0097539795293639","volume":"26","author":"L.M. Adleman","year":"1997","unstructured":"Adleman, L.M., DeMarrais, J., Huang, M.D.A.: Quantum computability. SIAM Journal on Computing\u00a026(5), 1524\u20131540 (1997)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"29_CR2","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0304-3975(02)00138-X","volume":"287","author":"A. Ambainis","year":"2002","unstructured":"Ambainis, A., Watrous, J.: Two\u2013way finite automata with quantum and classical states. Theoretical Computer Science\u00a0287(1), 299\u2013311 (2002)","journal-title":"Theoretical Computer Science"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Babai, L.: Trading group theory for randomness. In: STOC 1985, pp. 421\u2013429 (1985)","DOI":"10.1145\/22145.22192"},{"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","unstructured":"Condon, A.: Computational Models of Games. MIT Press (1989)"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Condon, A., Feigenbaum, J., Lund, C., Shor, P.: Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions (extended abstract). In: STOC 1993, pp. 305\u2013314. ACM (1993)","DOI":"10.1145\/167088.167190"},{"issue":"3","key":"29_CR7","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1016\/0022-0000(88)90038-4","volume":"36","author":"A. Condon","year":"1988","unstructured":"Condon, A., Ladner, R.E.: Probabilistic game automata. Journal of Computer and System Sciences\u00a036(3), 452\u2013489 (1988)","journal-title":"Journal of Computer and System Sciences"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Condon, A., Lipton, R.J.: On the complexity of space bounded interactive proofs (extended abstract). In: FOCS 1989, pp. 462\u2013467 (1989)","DOI":"10.1109\/SFCS.1989.63519"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Demirci, H.G., Say, A.C.C., Yakary\u0131lmaz, A.: The complexity of debate checking. Theory of Computing Systems (2014), doi:10.1007\/s00224-014-9547-7","DOI":"10.1007\/s00224-014-9547-7"},{"issue":"4","key":"29_CR10","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1145\/146585.146599","volume":"39","author":"C. Dwork","year":"1992","unstructured":"Dwork, C., Stockmeyer, L.: Finite state verifiers I: The power of interaction. Journal of the ACM\u00a039(4), 800\u2013828 (1992)","journal-title":"Journal of the ACM"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Feige, U., Kilian, J.: Making games short (extended abstract). In: STOC 1997, pp. 506\u2013516. ACM (1997)","DOI":"10.1145\/258533.258644"},{"issue":"1","key":"29_CR12","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_CR13","doi-asserted-by":"crossref","unstructured":"Gutoski, G., Watrous, J.: Toward a general theory of quantum games. In: STOC 2007, pp. 565\u2013574 (2007)","DOI":"10.1145\/1250790.1250873"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Kitaev, A.Y., Shen, A., Vyalyi, M.N.: Classical and Quantum Computation. American Mathematical Society (2002)","DOI":"10.1090\/gsm\/047"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Ladner, R.E., Lipton, R.J., Stockmeyer, L.J.: Alternating pushdown automata. In: FOCS 1978, pp. 92\u2013106 (1978)","DOI":"10.1109\/SFCS.1978.6"},{"key":"29_CR16","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","volume":"6","author":"M.O. Rabin","year":"1963","unstructured":"Rabin, M.O.: Probabilistic automata. Information and Control\u00a06, 230\u2013243 (1963)","journal-title":"Information and Control"},{"key":"29_CR17","unstructured":"Yakary\u0131lmaz, A.: Public-qubits versus private-coins. Tech. rep. (2012), ECCC:TR12-130"},{"key":"29_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-642-38536-0_29","volume-title":"Computer Science \u2013 Theory and Applications","author":"A. Yakary\u0131lmaz","year":"2013","unstructured":"Yakary\u0131lmaz, A.: Quantum alternation. In: Bulatov, A.A., Shur, A.M. (eds.) CSR 2013. LNCS, vol.\u00a07913, pp. 334\u2013346. Springer, Heidelberg (2013)"},{"issue":"2","key":"29_CR19","first-page":"19","volume":"12","author":"A. Yakary\u0131lmaz","year":"2010","unstructured":"Yakary\u0131lmaz, A., Say, A.C.C.: Succinctness of two-way probabilistic and quantum finite automata. Discrete Mathematics and Theoretical Computer Science\u00a012(2), 19\u201340 (2010)","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"issue":"6","key":"29_CR20","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/j.ic.2011.01.008","volume":"279","author":"A. Yakary\u0131lmaz","year":"2011","unstructured":"Yakary\u0131lmaz, A., Say, A.C.C.: Unbounded-error quantum computation with small space bounds. Information and Computation\u00a0279(6), 873\u2013892 (2011)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09698-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T12:03:53Z","timestamp":1558958633000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09698-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319096971","9783319096988"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09698-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}