Synchronous Boolean finite dynamical systems on directed graphs over XOR functions
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5595151 (Why is no real title available?)
- scientific article; zbMATH DE number 1741013 (Why is no real title available?)
- scientific article; zbMATH DE number 2046041 (Why is no real title available?)
- An introduction to the theory of numbers. Edited and revised by D. R. Heath-Brown and J. H. Silverman. With a foreword by Andrew Wiles
- Complexity of reachability problems for finite discrete dynamical systems
- Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs
- Dichotomy results for fixed point counting in Boolean dynamical systems
- Dichotomy results for fixed-point existence problems for Boolean dynamical systems
- Elements of a theory of simulation. II: Sequential dynamical systems.
- Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs
- Predecessor existence problems for finite discrete dynamical systems
- Reachability problems for sequential dynamical systems with threshold functions.
Cited in
(4)- Dynamics of synchronous Boolean networks with non-binary states
- Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs
- Discrete dynamical systems on graphs and Boolean functions
- Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions
This page was built for publication: Synchronous Boolean finite dynamical systems on directed graphs over XOR functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6109069)