TY - GEN
T1 - Search problems in the decision tree model
AU - Lovasz, Laszlo
AU - Naor, Moni
AU - Newman, Ilan
AU - Wigderson, Avi
PY - 1991/12
Y1 - 1991/12
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0026385077&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0026385077
SN - 0818624450
T3 - Annual Symposium on Foundations of Computer Science (Proceedings)
SP - 576
EP - 585
BT - Annual Symposium on Foundations of Computer Science (Proceedings)
PB - Publ by IEEE
T2 - Proceedings of the 32nd Annual Symposium on Foundations of Computer Science
Y2 - 1 October 1991 through 4 October 1991
ER -