Randomized parity decision trees satisfy direct sum theorems for lower bounds from discrepancy or product distributions, via a new skew complexity measure with perfect direct sum.
Lifting to bounded-depth and regular resolutions over parities via games
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Direct Sums for Parity Decision Trees
Randomized parity decision trees satisfy direct sum theorems for lower bounds from discrepancy or product distributions, via a new skew complexity measure with perfect direct sum.