Catalytic Space: Non-determinism and Hierarchy

Authors Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman

Thumbnail PDF


  • Filesize: 0.66 MB
  • 13 pages

Document Identifiers

Author Details

Harry Buhrman
Michal Koucký
Bruno Loff
Florian Speelman

Cite AsGet BibTex

Harry Buhrman, Michal Koucký, Bruno Loff, and Florian Speelman. Catalytic Space: Non-determinism and Hierarchy. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 24:1-24:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)


Catalytic computation, defined by Buhrman, Cleve, Koucký, Loff and Speelman (STOC 2014), is a space-bounded computation where in addition to our working memory we have an exponentially larger auxiliary memory which is full; the auxiliary memory may be used throughout the computation, but it must be restored to its initial content by the end of the computation. Motivated by the surprising power of this model, we set out to study the non-deterministic version of catalytic computation. We establish that non-deterministic catalytic log-space is contained in ZPP, which is the same bound known for its deterministic counterpart, and we prove that non-deterministic catalytic space is closed under complement (under a standard derandomization assumption). Furthermore, we establish hierarchy theorems for non-deterministic and deterministic catalytic computation.
  • catalytic computation
  • Immerman–Szelepcsényi theorem
  • space hierarchy


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. E. Allender, H. Buhrman, M. Koucký, D. van Melkebeek, and D. Ronneburger. Power from random strings. SIAM J. Comput., 35(6):1467-1493, June 2006. URL:
  2. S. Arora and B. Barak. Computational Complexity: A Modern Approach. Cambridge University Press, 2009. Google Scholar
  3. H. Buhrman, R. Cleve, M. Koucký, B. Loff, and F. Speelman. Computing with a full memory: Catalytic space. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing, STOC'14, pages 857-866, New York, NY, USA, 2014. ACM. URL:
  4. N. Immerman. Nondeterministic space is closed under complementation. SIAM Journal on Computing, 17(5):935-938, 1988. URL:
  5. R. Impagliazzo and A. Wigderson. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing, STOC'97, pages 220-229, New York, NY, USA, 1997. ACM. URL:
  6. R. Karp and R. Lipton. Turing machines that take advice. L'Enseignement Mathématique, 28:191-209, 1982. Google Scholar
  7. J. Kinne and D. van Melkebeek. Space hierarchy results for randomized and other semantic models. Computational Complexity, 19(3):423-475, 2010. URL:
  8. A. Klivans and D. van Melkebeek. Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. SIAM Journal on Computing, 31(5):1501-1526, 2002. URL:
  9. R. Szelepcsényi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26(3):279-284, 1988. URL:
  10. D. van Melkebeek and K. Pervyshev. A generic time hierarchy with one bit of advice. Computational Complexity, 16(2):139-179, 2007. URL:
  11. S. Žák. A Turing machine time hierarchy. Theoretical Computer Science, 26(3):327-333, 1983. URL: