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

DOI10.1007/978-3-030-92551-2_12OpenAlexW4225916364MaRDI QIDQ2086726

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

• Unnamed Item
• Unnamed Item
• The complexity of the bootstraping percolation and other problems
• Computational complexity of threshold automata networks under different updating schemes
• Bootstrap percolation in living neural networks
• Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework
• Negative circuits and sustained oscillations in asynchronous automata networks
• A note on \(\#\mathcal P\)-completeness of NP-witnessing relations
• Cellular automaton growth on \(\mathbb{Z}^2\): Theorems, examples, and problems
• A modified bootstrap percolation on a random graph coupled with a lattice
• The complexity of the asynchronous prediction of the majority automata
• Cell space approaches in biomathematics
• The Complexity of Enumeration and Reliability Problems
• Random disease on the square grid
• Computational Complexity
• Synchronism versus asynchronism in monotonic Boolean automata networks

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