The complexity of the asynchronous prediction of the majority automata (Q2201796): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cell space approaches in biomathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signal propagation in 2-dimensional threshold cellular space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-organized societies: on the Sakoda model of social interactions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On periodical behaviour in societies with symmetric influences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The convergence of symmetric threshold automata / 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: Neural networks and physical systems with emergent collective computational abilities. / 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: Q4843270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ${\mathcal{N} \mathcal{C}}$ Algorithm for Evaluating Monotone Planar Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the majority rule on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of threshold automata networks under different updating schemes / 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: On the complexity of two-dimensional signed majority cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4224656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues / rank
 
Normal rank

Revision as of 14:58, 23 July 2024

scientific article
Language Label Description Also known as
English
The complexity of the asynchronous prediction of the majority automata
scientific article

    Statements

    The complexity of the asynchronous prediction of the majority automata (English)
    0 references
    0 references
    0 references
    17 September 2020
    0 references
    majority automata
    0 references
    cellular automata
    0 references
    prediction problem
    0 references
    asynchronous updating
    0 references
    computational complexity
    0 references
    parallel algorithms
    0 references
    bootstrap percolation
    0 references
    NP-completeness
    0 references

    Identifiers