Content deleted Content added
Wavelength (talk | contribs) →Hidden subgroup problem: removing 1 hyphen: —> "previously mentioned"—WP:HYPHEN, sub-subsection 3, point 4 |
→Triangle-finding problem: Add ref for newer triangle algorithm |
||
Line 258:
{{main|Triangle finding problem}}
The triangle-finding problem is the problem of determining whether a given graph contains a triangle (a [[clique (graph theory)|clique]] of size 3). The best-known lower bound for quantum algorithms is Ω(''N''), but the best algorithm known requires O(''N''<sup>1.297</sup>) queries,<ref>{{cite arxiv| eprint=arXiv:1105.4024}}</ref> an improvement over the previous best O(''N''<sup>1.3</sup>) queries.<ref name=Search_via_quantum_walk>
{{cite conference
|last1=Magniez |first1=F.
| |||