8 search results - page 1 / 2 » coco 2000 |
77
Voted
COCO
2000
Springer
15 years 2 months ago
2000
Springer
69
Voted
COCO
2000
Springer
15 years 2 months ago
2000
Springer
79
Voted
COCO
2000
Springer
15 years 2 months ago
2000
Springer
We show that the Shortest Path Problem cannot be solved in o(log n) time on an unbounded fan-in PRAM without bit operations using poly(n) processors even when the bit-lengths of t...
82
Voted
COCO
2000
Springer
15 years 1 months ago
2000
Springer
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
122
Voted
COCO
2000
Springer
15 years 2 months ago
2000
Springer
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...