Computational complexity of threshold automata networks under different updating schemes (Q475388): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q1165215 |
||
| Property / author | |||
| Property / author: Q235721 / rank | |||
Revision as of 07:28, 22 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity of threshold automata networks under different updating schemes |
scientific article |
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
