5215 search results - page 6 / 1043 » Quantum clustering algorithms |
FOCS
2003
IEEE
14 years 3 months 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...
STOC
2003
ACM
14 years 10 months ago
2003
ACM
STOC
2002
ACM
14 years 10 months ago
2002
ACM
STOC
2001
ACM
14 years 10 months ago
2001
ACM
SODA
2012
ACM
12 years 4 days 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...