Sciweavers

8 search results - page 1 / 2
» coco 2000
Sort
View
COCO
2000
Springer
125views Algorithms» more  COCO 2000»
13 years 10 months ago
The Communication Complexity of Enumeration, Elimination, and Selection
Andris Ambainis, Harry Buhrman, William I. Gasarch...
COCO
2000
Springer
123views Algorithms» more  COCO 2000»
13 years 10 months ago
A Lower Bound for the Shortest Path Problem
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...
Ketan Mulmuley, Pradyut Shah
COCO
2000
Springer
107views Algorithms» more  COCO 2000»
13 years 10 months ago
On the Complexity of Intersecting Finite State Automata
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...
George Karakostas, Richard J. Lipton, Anastasios V...
COCO
2000
Springer
161views Algorithms» more  COCO 2000»
13 years 10 months ago
Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity
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 ...
Ronald de Wolf