On the parameterized complexity of freezing dynamics
From MaRDI portal
Publication:6499443
DOI10.1016/J.AAM.2024.102706MaRDI QIDQ6499443FDOQ6499443
Authors: Eric Goles, Pedro Montealegre, Martín Ríos-Wilson, Guillaume Theyssier
Publication date: 8 May 2024
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
treewidthprediction problemfast parallel algorithmsasynchronous reachabilityfreezing automata networkspredecessor problemnilpotency problem
Cites Work
- Fundamentals of parameterized complexity
- Computational Complexity
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Simple dynamics on graphs
- Undirected connectivity in log-space
- Complexity of Finding Embeddings in a k-Tree
- The complexity of theorem-proving procedures
- Graph minors. V. Excluding a planar graph
- The Nilpotency Problem of One-Dimensional Cellular Automata
- Title not available (Why is that?)
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Computational complexity of finite asynchronous cellular automata
- Constraint satisfaction with bounded treewidth revisited
- Title not available (Why is that?)
- Parallel Algorithms with Optimal Speedup for Bounded Treewidth
- Directed Nowhere Dense Classes of Graphs
- Sharp metastability threshold for two-dimensional bootstrap percolation
- Bootstrap percolation in power-law random graphs
- The sharp threshold for bootstrap percolation in all dimensions
- Bootstrap percolation on the hypercube
- Cellular automaton growth on \(\mathbb{Z}^2\): Theorems, examples, and problems
- The complexity of the bootstraping percolation and other problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs
- Title not available (Why is that?)
- Counter machines and distributed automata -- a story about exchanging space and time
- Cellular automata with sparse communication
- Universality in freezing cellular automata
- A brief tour of theoretical tile self-assembly
- On the computational complexity of the freezing non-strict majority automata
- Polynomial bounds for the grid-minor theorem
- Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata
- Nilpotent dynamics on signed interaction graphs and weak converses of Thomas' rules
This page was built for publication: On the parameterized complexity of freezing dynamics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499443)