Dichotomy results for fixed-point existence problems for Boolean dynamical systems
From MaRDI portal
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph minors (05C83) Dynamical aspects of cellular automata (37B15) Cellular automata (computational aspects) (68Q80) Boolean functions (06E30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
- Dichotomy results for fixed point counting in Boolean dynamical systems
- Generalized predecessor existence problems for Boolean finite dynamical systems
- Fixed points in generalized parallel and sequential dynamical systems induced by a minterm or maxterm Boolean functions
- Publication:3473805
- On the transient of Boolean monomial dynamical systems
- Boolean dynamical systems
- Boolean monomial dynamical systems
- scientific article; zbMATH DE number 2085280
- Dynamics classification of Boolean networks and solutions of Diophantine equation
- Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs
Cited in
(17)- Synchronous Boolean finite dynamical systems on directed graphs over XOR functions
- On the dynamics of semilattice networks
- Sequentialization and procedural complexity in automata networks
- Computational complexity studies of synchronous Boolean finite dynamical systems
- Complexity of inferring local transition functions of discrete dynamical systems
- Unconventional Computation
- Fixed points in generalized parallel and sequential dynamical systems induced by a minterm or maxterm Boolean functions
- Existence, coexistence and uniqueness of fixed points in parallel and sequential dynamical systems over directed graphs
- Complexity of fixed point counting problems in Boolean networks
- Existence and number of fixed points of Boolean transformations via the semi-tensor product method
- Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs
- Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems
- Boolean Difference Equations, I: Formulation and Dynamic Behavior
- Dichotomy results for fixed point counting in Boolean dynamical systems
- Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions
- Generalized predecessor existence problems for Boolean finite dynamical systems
- Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs
This page was built for publication: Dichotomy results for fixed-point existence problems for Boolean dynamical systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q926325)
