Pages that link to "Item:Q1704107"
From MaRDI portal
The following pages link to On the computational complexity of the freezing non-strict majority automata (Q1704107):
Displaying 7 items.
- Freezing sandpiles and Boolean threshold networks: equivalence and complexity (Q2020018) (← links)
- Sandpile toppling on Penrose tilings: identity and isotropic dynamics (Q2086724) (← links)
- Majority rule cellular automata (Q2232605) (← links)
- Cellular automata and bootstrap percolation (Q2672642) (← links)
- Freezing, Bounded-Change and Convergent Cellular Automata (Q5864724) (← links)
- Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata (Q6163609) (← links)
- On the parameterized complexity of freezing dynamics (Q6499443) (← links)