Gate elimination arguments for Boolean circuit lower bounds can be made constructive, producing efficient refuters that output counterexamples for undersized circuits.
8 Stefan Grosser and Marco Carmosino
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Constructive Separations from Gate Elimination
Gate elimination arguments for Boolean circuit lower bounds can be made constructive, producing efficient refuters that output counterexamples for undersized circuits.