6 search results - page 1 / 2 » Improved bounds for the randomized decision tree complexity ... |
ECCC
2010
13 years 2 months ago
2010
We consider the randomized decision tree complexity of the recursive 3-majority function. For evaluating a height h formulae, we prove a lower bound for the -two-sided-error rando...
ALGORITHMICA
2002
13 years 4 months ago
2002
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
COCO
1991
Springer
13 years 8 months ago
1991
Springer
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
ICALP
2001
Springer
13 years 9 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
AAAI
1996
13 years 6 months ago
1996
It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very...