Monotone bipartite graph properties are evasive
SIAM Journal on Computing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Learning decision trees using the Fourier spectrum
SIAM Journal on Computing
Communication complexity and combinatorial lattice theory
Journal of Computer and System Sciences
Constant depth circuits, Fourier transform, and learnability
Journal of the ACM (JACM)
On the degree of Boolean functions as real polynomials
Computational Complexity - Special issue on circuit complexity
Some results related to the evasiveness conjectures
Journal of Combinatorial Theory Series B
Evasiveness of Subgraph Containment and Related Properties
SIAM Journal on Computing
Complexity measures and decision tree complexity: a survey
Theoretical Computer Science - Complexity and logic
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Bounds on the time for parallel RAM's to compute simple functions
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Sensitivity, block sensitivity, and l-block sensitivity of boolean functions
Information and Computation
On the Sensitivity of Cyclically-Invariant Boolean Functions
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Every decision tree has an in.uential variable
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Probabilistic Boolean decision trees and the complexity of evaluating game trees
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Computational Complexity: A Modern Approach
Computational Complexity: A Modern Approach
Testing Fourier Dimensionality and Sparsity
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
On the parity complexity measures of Boolean functions
Theoretical Computer Science
Evasiveness through a circuit lens
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |
The decision tree model, aka the query model, perhaps due to its simplicity and fundamental nature has been extensively studied over decades. Yet there remain some fascinating open questions about it. The purpose of this paper is to revisit three such conjectures in decision tree complexity and present related open questions.