Uses discrete ODE schemas to give uniform recursion-theoretic and first-order proof-theoretic characterizations of all FAC0[n] circuit classes.
On proofs about threshold circuits and counting hierarchies
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
-
Recursion and proof theoretical characterizations of small circuit classes with modulo counting via discrete differential equations (long version)
Uses discrete ODE schemas to give uniform recursion-theoretic and first-order proof-theoretic characterizations of all FAC0[n] circuit classes.