5215 search results - page 6 / 1043 » Quantum clustering algorithms |
207
click to vote
FOCS
2003
IEEE
16 years 26 days ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
176
Voted
STOC
2003
ACM
16 years 7 months ago
2003
ACM
205
Voted
STOC
2002
ACM
16 years 7 months ago
2002
ACM
224
click to vote
SODA
2012
ACM
13 years 10 months ago
2012
ACM
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our resu...