Computational complexity of threshold automata networks under different updating schemes (Q475388): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q45 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q15 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q80 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6374349 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
automata networks | |||
| Property / zbMATH Keywords: automata networks / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
threshold functions | |||
| Property / zbMATH Keywords: threshold functions / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
computational complexity | |||
| Property / zbMATH Keywords: computational complexity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
updating scheme | |||
| Property / zbMATH Keywords: updating scheme / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
P-completeness | |||
| Property / zbMATH Keywords: P-completeness / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
NC | |||
| Property / zbMATH Keywords: NC / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
NP-hardness | |||
| Property / zbMATH Keywords: NP-hardness / rank | |||
Normal rank | |||
Revision as of 17:45, 30 June 2023
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
