Catalytic Space: Non-determinism and Hierarchy
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F18%3A10368582" target="_blank" >RIV/00216208:11320/18:10368582 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s00224-017-9784-7" target="_blank" >http://dx.doi.org/10.1007/s00224-017-9784-7</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00224-017-9784-7" target="_blank" >10.1007/s00224-017-9784-7</a>
Alternative languages
Result language
angličtina
Original language name
Catalytic Space: Non-determinism and Hierarchy
Original language description
Catalytic computation, defined by Buhrman, Cleve, Koucky, 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.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
R - Projekt Ramcoveho programu EK
Others
Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Theory of Computing Systems
ISSN
1432-4350
e-ISSN
—
Volume of the periodical
62
Issue of the periodical within the volume
1
Country of publishing house
DE - GERMANY
Number of pages
20
Pages from-to
116-135
UT code for WoS article
000419479100005
EID of the result in the Scopus database
2-s2.0-85020488734