For every Boolean f, bounded-error quantum and classical deterministic communication complexity of f ∘ AND₂ are polynomially related up to polylog n, both characterized by log of De Morgan sparsity of f.
Learning decision trees from random examples
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Defines rank-bounded rotation distance, reduces general rotation distance to it in polynomial time, and gives O(n^2) algorithm plus quadratic upper bound for skew trees.
citing papers explorer
-
On Rotation Distance of Rank Bounded Trees
Defines rank-bounded rotation distance, reduces general rotation distance to it in polynomial time, and gives O(n^2) algorithm plus quadratic upper bound for skew trees.