scientific article; zbMATH DE number 6829365

DOI10.4230/LIPICS.STACS.2016.24MaRDI QIDQ4601876zbMATH OpenFDO

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

Publication date 24 January 2018

zbMATH Keywords

space hierarchycatalytic computationImmerman-Szelepcsényi theorem

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Catalytic space: non-determinism and hierarchy
• Implementation and Application of Automata
• On pure space vs catalytic space
• On pure space vs catalytic space
• A Hierarchy of Nondeterminism
• Deterministic catalytic systems are not universal
• Proofs of Catalytic Space
• A categorial approach to reaction systems: first steps
• scientific article; zbMATH DE number 714758

Cited in

(7)

• Proofs of Catalytic Space
• Frameworks for designing in-place graph algorithms
• On pure space vs catalytic space
• Catalytic computation
• A framework for in-place graph algorithms
• Catalytic space: non-determinism and hierarchy
• Computing with a full memory: catalytic space

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4601876)