scientific article; zbMATH DE number 1848281

zbMath1006.37012MaRDI QIDQ4785459

Richard E. Stearns, S. S. Ravi, Madhav V. Marathe, Daniel J. Rosenkrantz, Chris L. Barrett, Harry B. III Hunt

Publication date: 10 March 2003

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

cellular automatareachability problemsdichotomy between classes of SDSefficiently solvable

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Dynamical aspects of cellular automata (37B15)

Related Items (4)

Complexity of reachability problems for finite discrete dynamical systems ⋮ Reachability problems for sequential dynamical systems with threshold functions. ⋮ Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems ⋮ ETS IV: Sequential dynamical systems: fixed points, invertibility and equivalence

This page was built for publication: