Computational complexity of threshold automata networks under different updating schemes (Q475388): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(10 intermediate revisions by 9 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.tcs.2014.09.010 / rank | |||
Property / author | |||
Property / author: Q235721 / rank | |||
Property / author | |||
Property / author: Eric Goles Chacc / rank | |||
Normal rank | |||
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 | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2014.09.010 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2065909799 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decreasing energy functions as a tool for studying threshold networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4023519 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computational Complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4843270 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Majority-vote cellular automata, Ising dynamics, and \(\mathbf P\)-completeness / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Neural networks and physical systems with emergent collective computational abilities. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An introduction to sequential dynamical systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of the bootstraping percolation and other problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: No polynomial bound for the period of the parallel chip firing game on graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3518705 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3998725 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On efficient parallel strong orientation / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.TCS.2014.09.010 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 18:34, 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