Computational complexity of threshold automata networks under different updating schemes (Q475388): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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

Revision as of 08:17, 9 July 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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references