A random NP-complete problem for inversion of 2D cellular automata

DOI10.1007/3-540-59042-0_65zbMath1379.68148MaRDI QIDQ4596613

Bruno Durand

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

Mathematics Subject Classification ID

68Q80: Cellular automata (computational aspects)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)