Articles under category:
Decision Tree
Decision Tree
|
Vol 19, Article 9 (pp 1-35)
Optimal Composition Theorem for Randomized Query Complexity by Dmytro Gavinsky, Troy Lee, Miklos Santha, and Swagato Sanyal |
|
Vol 13, Article 7 (pp 1-18)
A Communication Game Related to the Sensitivity Conjecture by Justin Gilmer, Michal Koucký, and Michael Saks |
|
Vol 10, Article 6 (pp 133-166)
The Need for Structure in Quantum Speedups by Scott Aaronson and Andris Ambainis |
|
Vol 9, Article 17 (pp 587-592)
[NOTE]
[Boolean Spec Issue]
A Monotone Function Given By a Low-Depth Decision Tree That Is Not an Approximate Junta by Daniel Kane |
|
Vol 7, Article 11 (pp 155-176)
Distribution-Free Testing for Monomials with a Sublinear Number of Queries by Elya Dolev and Dana Ron |
|
Vol 7, Article 10 (pp 147-153)
[NOTE]
The Influence Lower Bound Via Query Elimination by Rahul Jain and Shengyu Zhang |
|
Vol 6, Article 6 (pp 113-134)
Rounds vs. Queries Tradeoff in Noisy Computation by Navin Goyal and Michael Saks |
|
Vol 6, Article 4 (pp 81-84)
[NOTE]
Decision Trees and Influence: an Inductive Proof of the OSSS Inequality by Homin K. Lee |
|
Vol 5, Article 10 (pp 191-216)
Distribution-Free Testing Lower Bound for Basic Boolean Functions by Dana Glasner and Rocco A. Servedio |