Name
Abstract | ||
|---|---|---|
Catalytic computation, defined by Buhrman, Cleve, Koucký, Loff and Speelman (STOC ), 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 , 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. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/s00224-017-9784-7 | Theory Comput. Syst. |
Keywords | DocType | Volume |
Computational complexity,Space complexity,Non-determinism | Journal | 62 |
Issue | ISSN | Citations |
1 | 1432-4350 | 0 |
PageRank | References | Authors |
0.34 | 8 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Harry Buhrman | 1 | 1607 | 117.99 |
| Michal Koucký | 2 | 392 | 31.87 |
| Bruno Loff | 3 | 49 | 10.39 |
| Florian Speelman | 4 | 44 | 5.61 |