{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:22:27Z","timestamp":1726410147637},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540921813"},{"type":"electronic","value":"9783540921820"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92182-0_79","type":"book-chapter","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T02:38:06Z","timestamp":1228876686000},"page":"907-918","source":"Crossref","is-referenced-by-count":2,"title":["Quantum Query Complexity of Boolean Functions with Small On-Sets"],"prefix":"10.1007","author":[{"given":"Andris","family":"Ambainis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuo","family":"Iwama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masaki","family":"Nakanishi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harumichi","family":"Nishimura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rudy","family":"Raymond","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seiichiro","family":"Tani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shigeru","family":"Yamashita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"79_CR1","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1137\/S0097539704447237","volume":"35","author":"S. Aaronson","year":"2006","unstructured":"Aaronson, S.: Lower bounds for local search by quantum arguments. SIAM J. Comput.\u00a035(4), 804\u2013824 (2006)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"79_CR2","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1145\/1008731.1008735","volume":"51","author":"S. Aaronson","year":"2004","unstructured":"Aaronson, S., Shi, Y.: Quantum lower bounds for the collision and the element distinctness problems. J. ACM\u00a051(4), 595\u2013605 (2004)","journal-title":"J. ACM"},{"issue":"1","key":"79_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0020-0190(99)00079-4","volume":"71","author":"A. Ambainis","year":"1999","unstructured":"Ambainis, A.: A note on quantum black-box complexity of almost all Boolean functions. Inf. Process. Lett.\u00a071(1), 5\u20137 (1999)","journal-title":"Inf. Process. Lett."},{"key":"79_CR4","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. J. Comput. Sys. Sci.\u00a064, 750\u2013767 (2002)","journal-title":"J. Comput. Sys. Sci."},{"issue":"1","key":"79_CR5","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/S0097539705447311","volume":"37","author":"A. Ambainis","year":"2007","unstructured":"Ambainis, A.: Quantum walk algorithm for element distinctness. SIAM J. Comput.\u00a037(1), 210\u2013239 (2007)","journal-title":"SIAM J. Comput."},{"key":"79_CR6","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Childs, A.M., Reichardt, B.W., \u0160palek, R., Zhang, S.: Any AND-OR formula of size N can be evaluated in time N\n                  1\/2\u2009+\u2009o(1) on a quantum computer. In: Proc. 48th FOCS, pp. 363\u2013372 (2007)","DOI":"10.1109\/FOCS.2007.57"},{"key":"79_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-540-24749-4_10","volume-title":"STACS 2004","author":"A. Ambainis","year":"2004","unstructured":"Ambainis, A., Iwama, K., Kawachi, A., Masuda, H., Putra, R.H., Yamashita, S.: Quantum identification of Boolean oracles. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 105\u2013116. Springer, Heidelberg (2004)"},{"issue":"1","key":"79_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.tcs.2006.12.013","volume":"378","author":"A. Ambainis","year":"2007","unstructured":"Ambainis, A., Iwama, K., Kawachi, A., Raymond, R., Yamashita, S.: Improved algorithms for quantum identification of Boolean oracles. Theor. Comput. Sci.\u00a0378(1), 41\u201353 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"79_CR9","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0166-218X(94)00008-2","volume":"61","author":"M. Anthony","year":"1995","unstructured":"Anthony, M.: Classification by polynomial surfaces. Discrete Applied Mathematics\u00a061, 91\u2013103 (1995)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"79_CR10","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. J. ACM\u00a048(4), 778\u2013797 (2001)","journal-title":"J. ACM"},{"key":"79_CR11","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Cleve, R., de Wolf, R., Zalka, C.: Bounds for small-error and zero-error quantum algorithms. In: Proc. 40th FOCS, pp. 358\u2013368 (1999)","DOI":"10.1109\/SFFCS.1999.814607"},{"key":"79_CR12","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Vereschagin, N., de Wolf, R.: On computation and communication with small bias. In: Proc.\u00a022nd CCC, pp. 24\u201332 (2007)","DOI":"10.1109\/CCC.2007.18"},{"key":"79_CR13","doi-asserted-by":"crossref","unstructured":"van Dam, W.: Quantum oracle interrogation: getting all information for almost half the price. In: Proc. 39th FOCS, pp. 362\u2013367 (1998)","DOI":"10.1109\/SFCS.1998.743486"},{"key":"79_CR14","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R. Diestel","year":"2000","unstructured":"Diestel, R.: Graph Theory, 2nd edn. Graduate Texts in Mathematics. Springer, Heidelberg (2000)","edition":"2"},{"key":"79_CR15","doi-asserted-by":"crossref","unstructured":"O\u2019Donnell, R., Servedio, R.A.: Extremal properties of polynomial threshold functions. In: Proc. 18th CCC, pp. 3\u201312 (2003)","DOI":"10.1109\/CCC.2003.1214406"},{"issue":"6","key":"79_CR16","doi-asserted-by":"publisher","first-page":"1310","DOI":"10.1137\/050644719","volume":"35","author":"C. D\u00fcrr","year":"2006","unstructured":"D\u00fcrr, C., Heiligman, M., H\u00f8yer, P., Mhalla, M.: Quantum query complexity of some graph problems. SIAM J. Comput.\u00a035(6), 1310\u20131328 (2006)","journal-title":"SIAM J. Comput."},{"key":"79_CR17","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A quantum algorithm for the Hamiltonian NAND tree. quant-ph\/0702144 (2007)"},{"key":"79_CR18","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proc. 28th STOC, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"79_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/3-540-45061-0_25","volume-title":"Automata, Languages and Programming","author":"P. H\u00f8yer","year":"2003","unstructured":"H\u00f8yer, P., Mosca, M., de Wolf, R.: Quantum search on bounded-error inputs. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 291\u2013299. Springer, Heidelberg (2003)"},{"key":"79_CR20","first-page":"78","volume":"87","author":"P. H\u00f8yer","year":"2005","unstructured":"H\u00f8yer, P., \u0160palek, R.: Lower bounds on quantum query complexity. Bulletin of the EATCS\u00a087, 78\u2013103 (2005)","journal-title":"Bulletin of the EATCS"},{"key":"79_CR21","doi-asserted-by":"crossref","unstructured":"Magniez, F., Nayak, A., Roland, J., Santha, M.: Search via quantum walk. In: Proc. 39th STOC, pp. 575\u2013584 (2007)","DOI":"10.1145\/1250790.1250874"},{"key":"79_CR22","unstructured":"Magniez, F., Santha, M., Szegedy, M.: Quantum algorithms for the triangle problem. In: Proc. ACM-SIAM SODA, pp. 1109\u20131117 (2005)"},{"key":"79_CR23","doi-asserted-by":"crossref","unstructured":"Montanaro, A., Nishimura, H., Raymond, R.: Unbounded-error quantum query complexity. In: Proc. 19th ISAAC (to appear, 2008)","DOI":"10.1007\/978-3-540-92182-0_80"},{"issue":"2-3","key":"79_CR24","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.tcs.2005.01.019","volume":"339","author":"S. Zhang","year":"2005","unstructured":"Zhang, S.: On the power of Ambainis lower bounds. Theor. Comput. Sci.\u00a0339(2-3), 241\u2013256 (2005)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92182-0_79","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T09:49:28Z","timestamp":1551692968000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92182-0_79"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921813","9783540921820"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92182-0_79","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}