Computing the probability of getting infected: on the counting complexity of bootstrap percolation

DOI10.1007/978-3-030-92551-2_12MaRDI QIDQ2086726zbMATH OpenOpenAlexFDO

Authors Pedro Montealegre, Martín Ríos-Wilson

Publication date 25 October 2022

Full work available at URL https://doi.org/10.1007/978-3-030-92551-2_12

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 3382226 (Why is no real title available?)
• A modified bootstrap percolation on a random graph coupled with a lattice
• A note on \(\#\mathcal P\)-completeness of NP-witnessing relations
• An experimental study of robustness to asynchronism for elementary cellular automata
• Bootstrap percolation in living neural networks
• Cell space approaches in biomathematics
• Cellular automaton growth on \(\mathbb{Z}^2\): Theorems, examples, and problems
• Computational Complexity
• Computational complexity of threshold automata networks under different updating schemes
• Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework
• Negative circuits and sustained oscillations in asynchronous automata networks
• Random disease on the square grid
• Synchronism versus asynchronism in monotonic Boolean automata networks
• The Complexity of Enumeration and Reliability Problems
• The complexity of the asynchronous prediction of the majority automata
• The complexity of the bootstraping percolation and other problems

This page was built for publication: Computing the probability of getting infected: on the counting complexity of bootstrap percolation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2086726)