Content deleted Content added
m →Quantum query complexity of certain types of graph problems: wikistyle table titles and \log |
m →Quantum query complexity of certain types of graph problems: style corrections |
||
Line 97:
!Array model
|-
|Minimum
|<math>\Theta(n^{3/2})</math>
|<math>\Theta(\sqrt{nm})</math>
Line 105:
|<math>\Theta(n)</math>
|-
|Strong
|<math>\Theta(n^{3/2})</math>
|<math>\Omega(\sqrt{nm})</math>, <math>O(\sqrt{nm\log(n)})</math>
|-
|Single
|<math>\Omega(n^{3/2})</math>, <math>O(n^{3/2}\log^2n)</math>
|<math>\Omega(\sqrt{nm})</math>, <math>O(\sqrt{nm}\log^2(n))</math>
| |||