2026-07-25T02:34:10Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:5725 2024-03-06T10:36:56Z ddc:004 open_access

Catalytic Space: Non-determinism and Hierarchy Buhrman, Harry Koucký, Michal Loff, Bruno Speelman, Florian catalytic computation Immerman–Szelepcsényi theorem space hierarchy 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Harry Buhrman and Michal Koucký and Bruno Loff and Florian Speelman 2016 Is Part Of LIPIcs, Volume 47, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.STACS.2016.24 urn:nbn:de:0030-drops-57258 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.24 eng https://creativecommons.org/licenses/by/3.0/legalcode