scientific article; zbMATH DE number 1741013

zbMATH Open1017.68055MaRDI QIDQ4331197FDOQ4331197

Authors: Christopher L. Barrett, S. S. Ravi, R. E. Stearns, Predrag T. Tosic, H. B. III Hunt, Madhav V. Marathe, Daniel J. Rosenkrantz 

Publication date: 10 June 2002

Full work available at URL: http://www.emis.de/journals/DMTCS/proceedings/html/dmAA0106.abs.html

Title of this publication is not available (Why is that?)

Recommendations

• ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS
• Predecessors existence problems and Gardens of Eden in sequential dynamical systems
• On some special classes of sequential dynamical systems
• Elements of a theory of simulation. III: Equivalence of SDS.
• ETS IV: Sequential dynamical systems: fixed points, invertibility and equivalence

zbMATH Keywords

computational complexitycellular automatadiscrete dynamical systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited In (27)

• Dynamical attraction in parallel network models
• Predecessors existence problems and Gardens of Eden in sequential dynamical systems
• Predecessor existence problems for finite discrete dynamical systems
• Computational complexity studies of synchronous Boolean finite dynamical systems
• Complexity of inferring local transition functions of discrete dynamical systems
• Unconventional Computation
• Agent-based modeling, mathematical formalism for
• Solution to the predecessors and gardens-of-Eden problems for synchronous systems over directed graphs
• Title not available (Why is that?)
• Flexible toggles and symmetric invertible asynchronous elementary cellular automata
• Existence, coexistence and uniqueness of fixed points in parallel and sequential dynamical systems over directed graphs
• Predecessors and Garden-of-Eden configurations in parallel dynamical systems on maxterm and minterm Boolean functions
• Inferring local transition functions of discrete dynamical systems from observations of system behavior
• ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS
• Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs
• ETS IV: Sequential dynamical systems: fixed points, invertibility and equivalence
• On periods and equilibria of computational sequential systems
• The predecessor-existence problem for \(k\)-reversible processes
• Complexity of reachability problems for finite discrete dynamical systems
• Enumerating periodic orbits in sequential dynamical systems over graphs
• Attractors and transient in sequential dynamical systems
• Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions
• Dichotomy results for fixed point counting in Boolean dynamical systems
• Predecessors and Gardens of Eden in sequential dynamical systems over directed graphs
• Generalized predecessor existence problems for Boolean finite dynamical systems
• Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs
• Synchronous Boolean finite dynamical systems on directed graphs over XOR functions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4331197)