乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T09:08:41Z","timestamp":1712308121539},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,10,26]],"date-time":"2015-10-26T00:00:00Z","timestamp":1445817600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s00453-015-0084-9","type":"journal-article","created":{"date-parts":[[2015,10,26]],"date-time":"2015-10-26T10:07:30Z","timestamp":1445854050000},"page":"459-486","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Improved Quantum Query Algorithms for Triangle Detection and Associativity Testing"],"prefix":"10.1007","volume":"77","author":[{"given":"Troy","family":"Lee","sequence":"first","affiliation":[]},{"given":"Fr\u00e9d\u00e9ric","family":"Magniez","sequence":"additional","affiliation":[]},{"given":"Miklos","family":"Santha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,26]]},"reference":[{"key":"84_CR1","unstructured":"Belovs, A., Lee, T.: Quantum algorithm for k-distinctness with prior knowledge on the input. In: Technical Report arXiv:1108.3022 , arXiv (2011)"},{"key":"84_CR2","doi-asserted-by":"crossref","unstructured":"Belovs, A., Rosmanis, A.: On the power of non-adaptive learning graphs. In: Proceedings of the 28th IEEE Conference on Computational Complexity (2013)","DOI":"10.1109\/CCC.2013.14"},{"key":"84_CR3","doi-asserted-by":"crossref","unstructured":"Belovs, A.: Learning-graph-based quantum algorithm for k-distinctness. In: Prooceedings of 53rd Annual IEEE Symposium on Foundations of Computer Science (2012)","DOI":"10.1109\/FOCS.2012.18"},{"key":"84_CR4","doi-asserted-by":"crossref","unstructured":"Belovs, A.: Span programs for functions with constant-sized 1-certificates. In: Proceedings of 44th Symposium on Theory of Computing Conference, pp. 77\u201384 (2012)","DOI":"10.1145\/2213977.2213985"},{"key":"84_CR5","doi-asserted-by":"crossref","unstructured":"D\u00f6rn, S., Thierauf, T.: The quantum complexity of group testing. In: Proceedings of the 34th Conference on Current Trends in Theory and Practice of Computer Science, pp. 506\u2013518 (2008)","DOI":"10.1007\/978-3-540-77566-9_44"},{"key":"84_CR6","doi-asserted-by":"crossref","unstructured":"Grover, L.: A fast quantum mechanical algorithm for database search. In: Proceedings of 28th ACM Symposium on the Theory of Computing, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"84_CR7","doi-asserted-by":"crossref","unstructured":"H\u00f8yer, P., Lee, T., \u0160palek, R.: Negative weights make adversaries stronger. In: Proceedings of 39th ACM Symposium on Theory of Computing, pp. 526\u2013535 (2007)","DOI":"10.1145\/1250790.1250867"},{"key":"84_CR8","unstructured":"H\u00f8yer, P., \u0160palek, R.: Lower bounds on quantum query complexity. Bull. Eur. Assoc. Theor. Comput. Sci. 87 (2005). Also arXiv report quant-ph\/0509153v1"},{"key":"84_CR9","doi-asserted-by":"crossref","unstructured":"Jeffery, S., Kothari, R., Magniez, F.: Nested quantum walks with quantum data structures. In: Proceedings of the 24th ACM-SIAM Symposium on Discrete Algorithms (2013)","DOI":"10.1137\/1.9781611973105.106"},{"key":"84_CR10","unstructured":"Kothari, R.: Personal Communication (2011)"},{"key":"84_CR11","doi-asserted-by":"crossref","unstructured":"Le Gall, F.: Improved quantum algorithm for triangle finding via combinatorial arguments. In: Proceedings of the 55th Annual IEEE Symposium on Foundations of Computer Science, pp. 216\u2013225 (2014)","DOI":"10.1109\/FOCS.2014.31"},{"key":"84_CR12","doi-asserted-by":"publisher","unstructured":"Lee, T., Magniez, F., Santha, M.: A learning graph based quantum query algorithm for finding constant-size subgraphs. Chic. J. Theor. Comput. Sci. (2012). doi: 10.4086\/cjtcs.2012.010","DOI":"10.4086\/cjtcs.2012.010"},{"issue":"2","key":"84_CR13","doi-asserted-by":"crossref","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. 37(2), 413\u2013424 (2007)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"84_CR14","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1137\/S0097539797325387","volume":"29","author":"S Rajagopalan","year":"2000","unstructured":"Rajagopalan, S., Schulman, L.: Verification of identities. SIAM J. Comput. 29(4), 1155\u20131163 (2000)","journal-title":"SIAM J. Comput."},{"key":"84_CR15","doi-asserted-by":"crossref","unstructured":"Reichardt, B.: Reflections for quantum query algorithms. In: Proceedings of 22nd ACM-SIAM Symposium on Discrete Algorithms, pp. 560\u2013569 (2011)","DOI":"10.1137\/1.9781611973082.44"},{"issue":"5","key":"84_CR16","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P Shor","year":"1997","unstructured":"Shor, P.: Algorithms for quantum computation: discrete logarithm and factoring. SIAM J. Comput. 26(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"84_CR17","doi-asserted-by":"crossref","first-page":"1250019","DOI":"10.1142\/S0219749912500190","volume":"10","author":"Y Zhu","year":"2012","unstructured":"Zhu, Y.: Quantum query complexity of constant-sized subgraph containment. Int. J. Quantum Inf. 10(3), 1250019 (2012)","journal-title":"Int. J. Quantum Inf."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0084-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-0084-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0084-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0084-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T19:47:22Z","timestamp":1559072842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-0084-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,26]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["84"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-0084-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,26]]}}}