Counting and hardness-of-finding fixed points in cellular automata on random graphs (Q6639766)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting and hardness-of-finding fixed points in cellular automata on random graphs |
scientific article; zbMATH DE number 7945774
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting and hardness-of-finding fixed points in cellular automata on random graphs |
scientific article; zbMATH DE number 7945774 |
Statements
Counting and hardness-of-finding fixed points in cellular automata on random graphs (English)
0 references
18 November 2024
0 references
disordered systems
0 references
random graphs
0 references
phase transitions
0 references
cavity method
0 references
graph cellular automata
0 references
constraint satisfaction problems
0 references
belief propagation
0 references
0 references
