Search problems in the decision tree model (preliminary version)

Authors:
László Lovász;Moni Naor;Ilan Newman;Avi Wigderson
Affiliations:
-;-;-;-
Venue:
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Year:
1991

Citing 0
Cited 5

Randomized versus nondeterministic communication complexity

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the query complexity of finding a local maximum point

Information Processing Letters
On the Complexity of Finding a Local Maximum of Functions on Discrete Planar Subsets

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems

Annals of Mathematics and Artificial Intelligence
On the complexity of finding a local maximum of functions on discrete planar subsets

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The relative power of determinism, randomness, and nondeterminism for search problems in the Boolean decision tree model is studied. It is shown that the CNF search problem is complete for all the variants of decision trees. It is then shown that the gaps between the nondeterministic, the randomized, and the deterministic complexities can be arbitrarily large for search problems. The special case of nondeterministic complexity is discussed.