{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:51:16Z","timestamp":1725565876142},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228493"},{"type":"electronic","value":"9783540278368"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_83","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T18:53:21Z","timestamp":1284576801000},"page":"996-1005","source":"Crossref","is-referenced-by-count":2,"title":["A Polynomial Quantum Query Lower Bound for the Set Equality Problem"],"prefix":"10.1007","author":[{"given":"Gatis","family":"Midrij\u0101nis","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"83_CR1","doi-asserted-by":"crossref","unstructured":"Aaronson, S.: Quantum lower bound for the collision problem. In: Proceedings Proceedings of ACM STOC 2002, pp. 635\u2013642 (2002), quant-ph\/0111102","DOI":"10.1145\/509907.509999"},{"key":"83_CR2","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1006\/jcss.2002.1826","volume":"64","author":"A. Ambainis","year":"2002","unstructured":"Ambainis, A.: Quantum lower bounds by quantum arguments. Journal of Computer and System Sciences\u00a064, 750\u2013767 (2002); Earlier versions at STOC 2000 and quant-ph\/0002066","journal-title":"Journal of Computer and System Sciences"},{"key":"83_CR3","doi-asserted-by":"crossref","unstructured":"Ambainis, A.: Quantum query algorithms and lower bounds. In: Proceedings of FOTFS III (to appear)","DOI":"10.1007\/978-1-4020-2776-5_2"},{"key":"83_CR4","unstructured":"Ambainis, A.: Quantum lower bounds for collision and element distinctness with small range (2003); quant-ph\/0305179"},{"key":"83_CR5","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1145\/502090.502097","volume":"48","author":"R. Beals","year":"2001","unstructured":"Beals, R., Buhrman, H., Cleve, R., Mosca, M., de Wolf, R.: Quantum lower bounds by polynomials. Journal of ACM\u00a048, 778\u2013797 (2001); Earlier version at FOCS 1998 (1998)","journal-title":"Journal of ACM"},{"key":"83_CR6","unstructured":"Brassard, G., H\u00f8yer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. To appear in AMS Contemporary Mathematics Series Millennium Volume entitled \u201dQuantum Computation & Information\u201d"},{"key":"83_CR7","first-page":"212","volume":"2","author":"L.K. Grover","year":"1996","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. Journal of ACM\u00a02, 212\u2013219 (1996)","journal-title":"Journal of ACM"},{"key":"83_CR8","volume-title":"Quantum computing","author":"J. Gruska","year":"1999","unstructured":"Gruska, J.: Quantum computing. McGraw-Hill, New York (1999)"},{"key":"83_CR9","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s00453-002-0976-3","volume":"34","author":"P. Hoyer","year":"2002","unstructured":"Hoyer, P., Neerbek, J., Shi, Y.: Quantum lower bounds of ordered searching, sorting and element distinctness. Algorithmica\u00a034, 429\u2013448 (2002); Earlier versions at ICALP\u201901 and quant-ph\/0102078","journal-title":"Algorithmica"},{"key":"83_CR10","unstructured":"Kutin, S.: Quantum lower bound for the collision problem (2003); quant-ph\/0304162"},{"key":"83_CR11","unstructured":"Midrijanis, G.: Quantum lower bounds of set equality problems (2003); quantph\/ 0309068"},{"key":"83_CR12","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0020-0190(00)00069-7","volume":"75","author":"Y. Shi","year":"2000","unstructured":"Shi, Y.: Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables. Information Processing Letters\u00a075, 79\u201383 (2000)","journal-title":"Information Processing Letters"},{"key":"83_CR13","unstructured":"Shi, Y.: Quantum lower bounds for the collision and the element distinctness problems. In: Proceedings of the 43rd Annual Symposium on the Foundations of Computer Science, pp. 513\u2013519 (2002)"},{"key":"83_CR14","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/SFCS.1994.365700","volume-title":"Proceedings: 35th Annual Symposium on Foundations of Computer Science","author":"P.W. Shor","year":"1994","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New, Mexico, November 20-22, pp. 124\u2013134. IEEE Computer Society Press, Los Alamitos (1994)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_83.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:24:07Z","timestamp":1605741847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_83"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_83","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}