{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:56:50Z","timestamp":1725796610834},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319087825"},{"type":"electronic","value":"9783319087832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08783-2_37","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T10:04:30Z","timestamp":1404554670000},"page":"429-440","source":"Crossref","is-referenced-by-count":0,"title":["Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Le Gall","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harumichi","family":"Nishimura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seiichiro","family":"Tani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"37_CR1","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."},{"issue":"4","key":"37_CR2","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":"37_CR3","doi-asserted-by":"crossref","unstructured":"Belovs, A.: Span programs for functions with constant-sized 1-certificates: extended abstract. In: Proceedings of STOC, pp. 77\u201384 (2012)","DOI":"10.1145\/2213977.2213985"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Belovs, A.: Learning-graph-based quantum algorithm for k-distinctness. In: Proceedings of FOCS, pp. 207\u2013216 (2012)","DOI":"10.1109\/FOCS.2012.18"},{"key":"37_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-39206-1_10","volume-title":"Automata, Languages, and Programming","author":"A. Belovs","year":"2013","unstructured":"Belovs, A., Childs, A.M., Jeffery, S., Kothari, R., Magniez, F.: Time-efficient quantum walks for 3-distinctness. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part I. LNCS, vol.\u00a07965, pp. 105\u2013122. Springer, Heidelberg (2013)"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Belovs, A., Rosmanis, A.: On the power of non-adaptive learning graphs. In: Proceedings of CCC, pp. 44\u201355 (2013)","DOI":"10.1109\/CCC.2013.14"},{"issue":"6","key":"37_CR7","doi-asserted-by":"publisher","first-page":"1324","DOI":"10.1137\/S0097539702402780","volume":"34","author":"H. Buhrman","year":"2005","unstructured":"Buhrman, H., D\u00fcrr, C., Heiligman, M., H\u00f8yer, P., Magniez, F., Santha, M., de Wolf, R.: Quantum algorithms for element distinctness. SIAM J. Comput.\u00a034(6), 1324\u20131330 (2005)","journal-title":"SIAM J. Comput."},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Janson, S., \u0141uczak, T., Ruci\u0144ski, A.: Random Graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons (2000)","DOI":"10.1002\/9781118032718"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"Jeffery, S., Kothari, R., Magniez, F.: Nested quantum walks with quantum data structures. In: Proceedings of SODA, pp. 1474\u20131485 (2013)","DOI":"10.1137\/1.9781611973105.106"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Le Gall, F.: Improved output-sensitive quantum algorithms for Boolean matrix multiplication. In: Proceedings of SODA, pp. 1464\u20131476 (2012)","DOI":"10.1137\/1.9781611973099.116"},{"key":"37_CR11","unstructured":"Le Gall, F., Nishimura, H., Tani, S.: Quantum algorithms for finding constant-sized sub-hypergraphs. Full version of the present paper, available as arXiv:1310.4127"},{"key":"37_CR12","unstructured":"Lee, T., Magniez, F., Santha, M.: Learning graph based quantum query algorithms for finding constant-size subgraphs. Chicago J.\u00a0Theor.\u00a0Comput.\u00a0Sci., Article 10 (2012)"},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"Lee, T., Magniez, F., Santha, M.: Improved quantum query algorithms for triangle finding and associativity testing. In: Proceedings of SODA, pp. 1486\u20131502 (2013)","DOI":"10.1137\/1.9781611973105.107"},{"issue":"1","key":"37_CR14","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1137\/090745854","volume":"40","author":"F. Magniez","year":"2011","unstructured":"Magniez, F., Nayak, A., Roland, J., Santha, M.: Search via quantum walk. SIAM J. Comput.\u00a040(1), 142\u2013164 (2011)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"37_CR15","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/050643684","volume":"37","author":"F. Magniez","year":"2007","unstructured":"Magniez, F., Santha, M., Szegedy, M.: Quantum algorithms for the triangle problem. SIAM J. Comput.\u00a037(2), 413\u2013424 (2007)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"37_CR16","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1137\/09076619X","volume":"42","author":"V. Vassilevska Williams","year":"2013","unstructured":"Vassilevska Williams, V., Williams, R.: Finding, minimizing, and counting weighted subgraphs. SIAM J. Comput.\u00a042(3), 831\u2013854 (2013)","journal-title":"SIAM J. Comput."},{"key":"37_CR17","doi-asserted-by":"crossref","unstructured":"Vassilevska Williams, V., Williams, R.: Subcubic equivalences between path, matrix and triangle problems. In: Proceedings of FOCS, pp. 645\u2013654 (2010)","DOI":"10.1109\/FOCS.2010.67"},{"issue":"2-3","key":"37_CR18","first-page":"357","volume":"348","author":"R. Williams","year":"2005","unstructured":"Williams, R.: A new algorithm for optimal 2-constraint satisfaction and its implications. Theor.\u00a0Comput.\u00a0Sci.\u00a0348(2-3), 357\u2013365 (2005)","journal-title":"Theor.\u00a0Comput.\u00a0Sci."},{"key":"37_CR19","unstructured":"Williams, R.: Algorithms and resource requirements for fundamental problems. Ph.D. Thesis, Carnegie Mellon University (2007)"},{"issue":"3","key":"37_CR20","first-page":"1250019","volume":"10","author":"Y. Zhu","year":"2012","unstructured":"Zhu, Y.: Quantum query complexity of constant-sized subgraph containment. Int.\u00a0J.\u00a0Quant.\u00a0Inf.\u00a010(3), 1250019 (2012)","journal-title":"Int.\u00a0J.\u00a0Quant.\u00a0Inf."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08783-2_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T02:31:34Z","timestamp":1558924294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08783-2_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087825","9783319087832"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08783-2_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}