For every positive epsilon, circuits in SAC^2 can be evaluated with O(log^2 n / log log n) work space and near-polynomial catalytic memory, improving the previous free-space bound by a factor of log log n.
Computing algebraic formulas using a constant number of registers
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Catalytic Computing and Register Programs Beyond Log-Depth
For every positive epsilon, circuits in SAC^2 can be evaluated with O(log^2 n / log log n) work space and near-polynomial catalytic memory, improving the previous free-space bound by a factor of log log n.