Search Problems in the Decision Tree Model

Authors:
Laszlo Lovasz;Moni Naor;Ilan Newman;Avi Wigderson
Affiliations:
-;-;-;-
Venue:
SIAM Journal on Discrete Mathematics
Year:
1995

Citing 0
Cited 4

Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Present and Future of Practical SAT Solving

Complexity of Constraints
The Depth of Resolution Proofs

Studia Logica
On the virtue of succinct proofs: amplifying communication complexity hardness to time-space trade-offs in proof complexity

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing

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 gaps between the nondeterministic, the randomized, and the deterministic complexities can be arbitrarily large for search problems. An interesting connection of this model to the complexity of resolution proofs is also mentioned.