Computing the probability of getting infected: on the counting complexity of bootstrap percolation (Q2086726): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Bootstrap percolation in living neural networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random disease on the square grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5321519 / 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 asynchronous prediction of the majority automata / 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: Cellular automaton growth on \(\mathbb{Z}^2\): Theorems, examples, and problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified bootstrap percolation on a random graph coupled with a lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cell space approaches in biomathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on \(\#\mathcal P\)-completeness of NP-witnessing relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronism versus asynchronism in monotonic Boolean automata networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negative circuits and sustained oscillations in asynchronous automata networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank

Latest revision as of 15:49, 30 July 2024

scientific article
Language Label Description Also known as
English
Computing the probability of getting infected: on the counting complexity of bootstrap percolation
scientific article

    Statements

    Computing the probability of getting infected: on the counting complexity of bootstrap percolation (English)
    0 references
    0 references
    0 references
    25 October 2022
    0 references

    Identifiers