All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

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%2F16%3A10331495" target="_blank" >RIV/00216208:11320/16:10331495 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.4230/LIPIcs.STACS.2016.24" target="_blank" >http://dx.doi.org/10.4230/LIPIcs.STACS.2016.24</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.4230/LIPIcs.STACS.2016.24" target="_blank" >10.4230/LIPIcs.STACS.2016.24</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, 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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2016

  • 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

  • Article name in the collection

    Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016

  • ISBN

    978-3-95977-001-9

  • ISSN

    1868-8969

  • e-ISSN

  • Number of pages

    13

  • Pages from-to

    1-13

  • Publisher name

    Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

  • Place of publication

    Dagstuhl, Germany

  • Event location

    Orléans, France

  • Event date

    Feb 17, 2016

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article