Gate elimination arguments for Boolean circuit lower bounds can be made constructive, producing efficient refuters that output counterexamples for undersized circuits.
In this and the previous branches, the only indices of⃗ athat are changed are inI, and hence the condition that the error agrees with the original⃗ ai on all non-Iinputs is met
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.