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.
A new minimax theorem for randomized algorithms
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.CC 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 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.