Computational Complexity on the Blackboard

DOI10.3233/FI-2017-1523zbMath1375.68068OpenAlexW2613818397MaRDI QIDQ4595599

Eryk Kopczyński

Publication date: 5 December 2017

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2017-1523

zbMATH Keywords

cellular automataalternationSavitch theorem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cellular automata (computational aspects) (68Q80) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Axiomatizing Rectangular Grids with no Extra Non-unary Relations

This page was built for publication: Computational Complexity on the Blackboard