An Õ(Ω(n²)) lower bound for read-once parity branching programs is obtained by reducing to algebraic circuit lower bounds for an explicit function.
Razborov, and Roman Smolensky
1 Pith paper cite this work, alongside 129 external citations. Polarity classification is still indexing.
1
Pith paper citing it
129
external citations · OpenAlex
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Lower Bound for Read-Once Parity Branching Programs
An Õ(Ω(n²)) lower bound for read-once parity branching programs is obtained by reducing to algebraic circuit lower bounds for an explicit function.