Freezing sandpiles and Boolean threshold networks: equivalence and complexity (Q2020018): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3121017816 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2101.04204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality in freezing cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Hard is it to Predict Sandpiles on Lattices? A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing information in two-dimensional sandpiles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality of the chip-firing game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995985 / 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 majority rule on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Parallel Algorithm for the Robust Prediction of the Two-Dimensional Strict Majority Automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sandpile models and lattices: a comprehensive survey / 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 computational complexity of the freezing non-strict majority automata / 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: Q4843270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of pattern formation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684036 / 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: The computational complexity of sandpiles / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-completeness of Cellular Automaton Rule 110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Any Shape Can Ultimately Cross Information on Two-Dimensional Abelian Sandpile Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281699 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:27, 25 July 2024

scientific article
Language Label Description Also known as
English
Freezing sandpiles and Boolean threshold networks: equivalence and complexity
scientific article

    Statements

    Freezing sandpiles and Boolean threshold networks: equivalence and complexity (English)
    0 references
    0 references
    0 references
    0 references
    23 April 2021
    0 references

    Identifiers

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