Answers are grounded in this paper and cite their sources.
The relative power of determinism, randomness, and nondeterminism for search problems in the Boolean decision tree model is studied. It is shown that the gaffs 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.
No takes yet. Share an insight, caveat, or question.
Lovász et al. (1995) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: