Search problems in the decision tree model
- 9 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- On graph-theoretic lemmata and complexity classesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Query complexity, or why is it difficult to separateNP A ∩coNP A fromP A by random oraclesA?Combinatorica, 1989
- Exponential lower bounds for finding Brouwer fix pointsJournal of Complexity, 1989
- CREW PRAMS and decision treesPublished by Association for Computing Machinery (ACM) ,1989
- Many hard examples for resolutionJournal of the ACM, 1988
- Monotone circuits for connectivity require super-logarithmic depthPublished by Association for Computing Machinery (ACM) ,1988
- Decision trees and downward closuresPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Generic oracles and oracle classesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960