On the complexity of the stability problem of binary freezing totalistic cellular automata (Q2201794)
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: On the complexity of the stability problem of binary freezing totalistic cellular automata |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the stability problem of binary freezing totalistic cellular automata |
scientific article |
Statements
On the complexity of the stability problem of binary freezing totalistic cellular automata (English)
0 references
17 September 2020
0 references
cellular automata
0 references
computational complexity
0 references
freezing cellular automata
0 references
totalistic cellular automata
0 references
fast parallel algorithms
0 references
P-completeness
0 references
0.8502004146575928
0 references
0.8154284358024597
0 references
0.794940173625946
0 references
0.7941011786460876
0 references
0.7769715189933777
0 references
