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

Authors:
Bruno Durand
Affiliations:
-
Venue:
Theoretical Computer Science
Year:
1995

Citing 0
Cited 3

A brief history of cellular automata

ACM Computing Surveys (CSUR)
Tilings: Recursivity and Regularity

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Tilings: recursivity and regularity

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract