scientific article; zbMATH DE number 1741013
From MaRDI portal
Publication:4331197
zbMath1017.68055MaRDI QIDQ4331197
Richard E. Stearns, Christopher L. Barrett, S. S. Ravi, Predrag T. Tosic, Daniel J. Rosenkrantz, Madhav V. Marathe, Harry B. III Hunt
Publication date: 10 June 2002
Full work available at URL: http://www.emis.de/journals/DMTCS/proceedings/html/dmAA0106.abs.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (24)
Complexity of reachability problems for finite discrete dynamical systems ⋮ Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs ⋮ Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems ⋮ Computational Complexity Studies of Synchronous Boolean Finite Dynamical Systems ⋮ Synchronous Boolean finite dynamical systems on directed graphs over XOR functions ⋮ Predecessors and Gardens of Eden in sequential dynamical systems over directed graphs ⋮ The predecessor-existence problem for \(k\)-reversible processes ⋮ Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs ⋮ Predecessor existence problems for finite discrete dynamical systems ⋮ Agent-Based Modeling, Mathematical Formalism for ⋮ 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 ⋮ Dichotomy results for fixed point counting in Boolean dynamical systems ⋮ Solution to the predecessors and gardens-of-Eden problems for synchronous systems over directed graphs ⋮ Dynamical attraction in parallel network models ⋮ Flexible toggles and symmetric invertible asynchronous elementary cellular automata ⋮ On periods and equilibria of computational sequential systems ⋮ Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions ⋮ Enumerating periodic orbits in sequential dynamical systems over graphs ⋮ Predecessors existence problems and Gardens of Eden in sequential dynamical systems ⋮ Generalized Predecessor Existence Problems for Boolean Finite Dynamical Systems ⋮ ETS IV: Sequential dynamical systems: fixed points, invertibility and equivalence ⋮ Attractors and transient in sequential dynamical systems ⋮ Inferring local transition functions of discrete dynamical systems from observations of system behavior
This page was built for publication:
