2252 search results - page 22 / 451 » Lower Bounds for Dynamic Algorithms |
STOC
2000
ACM
13 years 12 months ago
2000
ACM
We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input,...
AAECC
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. We prove lower bounds on the degree of polynomials interpolating the Diffie
STOC
1992
ACM
13 years 11 months ago
1992
ACM
STOC
1995
ACM
13 years 11 months ago
1995
ACM
COCO
2004
Springer
14 years 1 months ago
2004
Springer
We consider the problem of testing bipartiteness in the adjacency matrix model. The best known algorithm, due to Alon and Krivelevich, distinguishes between bipartite graphs and g...