Computational complexity of threshold automata networks under different updating schemes (Q475388): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2014.09.010 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2014.09.010 / rank | |||
Normal rank | |||
Revision as of 02:20, 9 December 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
