We define the notion of a {\em catalytic-space} computation. This is a computation that has a small amount of clean space available and is equipped with additional auxiliary space, with the caveat that the additional space is initially in an arbitrary, possibly incompressible, state and must be returned to this state when the computation is finished. We show that the extra space can be used in a nontrivial way, to compute uniform $TC^1$-circuits with just a logarithmic amount of clean space. The extra space thus works analogously to a catalyst in a chemical reaction. $TC^1$-circuits can compute for example the determinant of a matrix, which is not known to be computable in logspace. In order to obtain our results we study an algebraic model of computation, a variant of straight-line programs. We employ register machines with input registers $x_1, \ldots, x_n$ and work registers $r_1, \ldots, r_m$. The instructions available are of the form $r_i \leftarrow r_i \pm u \times v$, with $u, v$ registers (distinct from $r_i$) or constants. We wish to compute a function $f(x_1, \ldots, x_n)$ through a sequence of such instructions. The working registers have some arbitrary initial value $r_i = \tau_i$, and they may be altered throughout the computation, but by the end all registers must be returned to their initial value $\tau_i$, except for, say, $r_1$ which must hold $\tau_1 + f(x_1, \ldots, x_n)$. We show that all of Valiant's class VP, and more, can be computed in this model. This significantly extends the framework and techniques of Ben-Or and Cleve [Ben-Or Cleve 1992]. Upper bounding the power of catalytic computation we show that catalytic logspace is contained in ZPP. We further construct an oracle world where catalytic logpace is equal to PSPACE, and show that under the exponential time hypothesis (ETH), SAT can not be computed in catalytic sub-linear space.

Additional Metadata
THEME Information (theme 2)
Publisher ACM
Persistent URL dx.doi.org/10.1145/2591796.2591874
Project Networks
Conference Annual ACM Symposium on Theory of Computing
Note Published version at http://dl.acm.org/citation.cfm?id=2591874
Grant This work was funded by the The Netherlands Organisation for Scientific Research (NWO); grant id nwo/024.002.003 - Networks
Buhrman, H, Cleve, R.E, Koucky, M, Loff Barreto, B. S, & Speelman, F. (2014). Computing with a full memory: catalytic space. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing (pp. 857–866). ACM. doi:10.1145/2591796.2591874