The complexity of the asynchronous prediction of the majority automata (Q2201796)
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: The complexity of the asynchronous prediction of the majority automata |
scientific article; zbMATH DE number 7248656
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of the asynchronous prediction of the majority automata |
scientific article; zbMATH DE number 7248656 |
Statements
The complexity of the asynchronous prediction of the majority automata (English)
0 references
17 September 2020
0 references
majority automata
0 references
cellular automata
0 references
prediction problem
0 references
asynchronous updating
0 references
computational complexity
0 references
parallel algorithms
0 references
bootstrap percolation
0 references
NP-completeness
0 references
0 references
0.8419228792190552
0 references
0.8136624693870544
0 references
0.8065167665481567
0 references
0.7978405356407166
0 references
0.7955616116523743
0 references
