On the complexity of generalized Q2R automaton
From MaRDI portal
Recommendations
- PSPACE-completeness of majority automata networks
- Computational complexity of threshold automata networks under different updating schemes
- Generalized Automata Networks
- Phase space classification of an Ising cellular automaton: the Q2R model
- On the computational complexity of finite cellular automata
Cites work
- scientific article; zbMATH DE number 3898249 (Why is no real title available?)
- scientific article; zbMATH DE number 107951 (Why is no real title available?)
- scientific article; zbMATH DE number 784042 (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
- Beitrag zur Theorie des Ferromagnetismus
- Invariant in cellular automata
- Majority-vote cellular automata, Ising dynamics, and P-completeness
- No polynomial bound for the period of the parallel chip firing game on graphs
- Phase space classification of an Ising cellular automaton: the Q2R model
- Relaxation properties of elementary reversible cellular automata
Cited in
(2)
This page was built for publication: On the complexity of generalized Q2R automaton
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2134005)