A random NP-complete problem for inversion of 2D cellular automata
From MaRDI portal
Publication:4596613
DOI10.1007/3-540-59042-0_65zbMath1379.68148OpenAlexW1526297133MaRDI QIDQ4596613
Publication date: 4 December 2017
Published in: STACS 95 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-59042-0_65
Cellular automata (computational aspects) (68Q80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)