Learning decision trees using the Fourier spectrum
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
SIAM Journal on Computing
Communication complexity
Quantum lower bounds by polynomials
Journal of the ACM (JACM)
Complexity measures and decision tree complexity: a survey
Theoretical Computer Science - Complexity and logic
On notions of information transfer in VLSI circuits
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Lattices, mobius functions and communications complexity
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Communication complexities of symmetric XOR functions
Quantum Information & Computation
Evasiveness through a circuit lens
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Gems in decision tree complexity revisited
ACM SIGACT News
On the structure of boolean functions with small spectral norm
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 5.23 |
The parity decision tree model extends the decision tree model by allowing the computation of a parity function in one step. We prove that the deterministic parity decision tree complexity of any Boolean function is polynomially related to the non-deterministic complexity of the function or its complement. We also show that they are polynomially related to an analogue of the block sensitivity. We further study parity decision trees in their relations with an intermediate variant of the decision trees, as well as with communication complexity.