Computational complexity of threshold automata networks under different updating schemes (Q475388)
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: Computational complexity of threshold automata networks under different updating schemes |
scientific article; zbMATH DE number 6374349
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of threshold automata networks under different updating schemes |
scientific article; zbMATH DE number 6374349 |
Statements
Computational complexity of threshold automata networks under different updating schemes (English)
0 references
26 November 2014
0 references
automata networks
0 references
threshold functions
0 references
computational complexity
0 references
updating scheme
0 references
P-completeness
0 references
NC
0 references
NP-hardness
0 references
0.8361141085624695
0 references
0.7921063899993896
0 references
0.7881054282188416
0 references
0.7698633670806885
0 references
