PSPACE-completeness of majority automata networks (Q897867)
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: PSPACE-completeness of majority automata networks |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | PSPACE-completeness of majority automata networks |
scientific article |
Statements
PSPACE-completeness of majority automata networks (English)
0 references
8 December 2015
0 references
Boolean network
0 references
majority network
0 references
prediction problem
0 references
PSPACE
0 references
0 references
0.8361141085624695
0 references
0.8152369856834412
0 references
0.8136624693870544
0 references
0.8130061030387878
0 references
0.7954593896865845
0 references
