Search problems in the decision tree model

Laszlo Lovasz, Moni Naor, Ilan Newman, Avi Wigderson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
PublisherPubl by IEEE
Pages576-585
Number of pages10
ISBN (Print)0818624450
Publication statusPublished - Dec 1 1991
EventProceedings of the 32nd Annual Symposium on Foundations of Computer Science - San Juan, PR, USA
Duration: Oct 1 1991Oct 4 1991

Publication series

NameAnnual Symposium on Foundations of Computer Science (Proceedings)
ISSN (Print)0272-5428

Other

OtherProceedings of the 32nd Annual Symposium on Foundations of Computer Science
CitySan Juan, PR, USA
Period10/1/9110/4/91

ASJC Scopus subject areas

  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Search problems in the decision tree model'. Together they form a unique fingerprint.

  • Cite this

    Lovasz, L., Naor, M., Newman, I., & Wigderson, A. (1991). Search problems in the decision tree model. In Annual Symposium on Foundations of Computer Science (Proceedings) (pp. 576-585). (Annual Symposium on Foundations of Computer Science (Proceedings)). Publ by IEEE.