On the public citation graph
On the complexity of enumerating possible dynamics of sparsely connected Boolean network automata with simple update rules
0 signed · 68 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/3527602968.ch4openalex-snapshot
Computation in Cellular Automata: A Selected Review
inferredcites →https://doi.org/10.1006/jcss.1995.1009openalex-snapshot
On the Computational Complexity of Finite Cellular Automata
inferredcites →https://doi.org/10.1006/jtbi.1996.0220openalex-snapshot
Counting and Classifying Attractors in High Dimensional Dynamical Systems
inferredcites →https://doi.org/10.1007/11560319_18openalex-snapshot
On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata
inferredcites →https://doi.org/10.1007/3-540-27477-4_16openalex-snapshot
The Complexity of Boolean Functions
inferredcites →https://doi.org/10.1007/3-540-57163-9_35openalex-snapshot
One-way cellular automata on cayley graphs
inferredcites →https://doi.org/10.1007/3-540-59042-0_65openalex-snapshot
A random NP-complete problem for inversion of 2D cellular automata
inferredcites →https://doi.org/10.1007/978-3-540-30479-1_89openalex-snapshot
Characterizing Configuration Spaces of Simple Threshold Cellular Automata
inferredcites →https://doi.org/10.1007/978-94-009-0529-0openalex-snapshot
Neural and Automata Networks: Dynamical Behavior and Applications
inferredcites →https://doi.org/10.1007/978-94-015-9223-9openalex-snapshot
Cellular Automata and Complex Systems
inferredcites →https://doi.org/10.1007/978-94-017-1005-3openalex-snapshot
Cellular Automata, Dynamical Systems and Neural Networks
inferredcites →https://doi.org/10.1007/bf00339943openalex-snapshot
“Neural” computation of decisions in optimization problems
inferredcites →https://doi.org/10.1007/bf01010403openalex-snapshot
Two-dimensional monomer-dimer systems are computationally intractable
inferredcites →https://doi.org/10.1007/bf01025864openalex-snapshot
Two-dimensional monomer-dimer systems are computationally intractable
inferredcites →https://doi.org/10.1007/bf01217347openalex-snapshot
Computation theory of cellular automata
inferredcites →https://doi.org/10.1007/pl00001601openalex-snapshot
The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
inferredcites →https://doi.org/10.1016/0004-3702(94)00092-1openalex-snapshot
On the hardness of approximate reasoning
inferredcites →https://doi.org/10.1016/0022-5193(69)90015-0openalex-snapshot
Metabolic stability and epigenesis in randomly constructed genetic nets
inferredcites →https://doi.org/10.1016/0167-2789(84)90249-5openalex-snapshot
Structure in asynchronous cellular automata
inferredcites →https://doi.org/10.1016/0167-2789(84)90257-4openalex-snapshot
Emergent properties in random complex automata
inferredcites →https://doi.org/10.1016/0304-3975(79)90044-6openalex-snapshot
The Complexity of Computing the Permanent
inferredcites →https://doi.org/10.1016/0304-3975(94)00293-ropenalex-snapshot
A Random NP-complete problem for inversion of 2D cellular automata
inferredcites →https://doi.org/10.1016/0304-3975(94)90236-4openalex-snapshot
One-way cellular automata on Cayley graphs
inferredcites →https://doi.org/10.1016/0304-3975(94)90244-5openalex-snapshot
Inversion of 2D cellular automata: some complexity results
inferredcites →https://doi.org/10.1016/0885-064x(85)90021-4openalex-snapshot
Monte-Carlo algorithms for the planar multiterminal network reliability problem
inferredcites →https://doi.org/10.1016/j.tcs.2004.11.021openalex-snapshot
Theory of cellular automata: A survey
inferredcites →https://doi.org/10.1016/s0012-365x(00)00115-1openalex-snapshot
Discrete, sequential dynamical systems
inferredcites →https://doi.org/10.1016/s0019-9958(80)90164-3openalex-snapshot
One-way bounded cellular automata
inferredcites →https://doi.org/10.1016/s0020-0190(97)00110-5openalex-snapshot
Finite automata-models for the investigation of dynamical systems
inferredcites →https://doi.org/10.1016/s0022-0000(05)80025-xopenalex-snapshot
Reversibility and surjectivity problems of cellular automata
inferredcites →https://doi.org/10.1016/s0022-0000(72)80009-6openalex-snapshot
Tessellations with local transformations
inferredcites →https://doi.org/10.1016/s0022-0000(72)80013-8openalex-snapshot
Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
inferredcites →https://doi.org/10.1016/s0096-3003(00)00042-4openalex-snapshot
Elements of a theory of simulation III: equivalence of SDS
inferredcites →https://doi.org/10.1016/s0096-3003(97)10166-7openalex-snapshot
Elements of a theory of computer simulation I: Sequential CA over random graphs
inferredcites →https://doi.org/10.1016/s0096-3003(98)10114-5openalex-snapshot
Elements of a theory of simulation II: sequential dynamical systems
inferredcites →https://doi.org/10.1016/s0304-3975(02)00395-xopenalex-snapshot
Reachability problems for sequential dynamical systems with threshold functions
inferredcites →https://doi.org/10.1073/pnas.79.8.2554openalex-snapshot
Neural networks and physical systems with emergent collective computational abilities.
inferredcites →https://doi.org/10.1073/pnas.90.16.7716openalex-snapshot
Evolutionary games and computer simulations.
inferredcites →https://doi.org/10.1088/0031-8949/1985/t9/029openalex-snapshot
Twenty Problems in the Theory of Cellular Automata
inferredcites →https://doi.org/10.1088/0305-4470/15/10/028openalex-snapshot
On the computational complexity of Ising spin glass models
inferredcites →https://doi.org/10.1090/s0002-9939-1963-0155764-9openalex-snapshot
The converse of Moore’s Garden-of-Eden theorem
inferredcites →https://doi.org/10.1109/ipdps.2004.1303188openalex-snapshot
Concurrency vs. sequential interleavings in 1-D threshold cellular automata
inferredcites →https://doi.org/10.1109/ipdps.2005.303openalex-snapshot
On Counting Fixed Point Configurations in Star Networks
inferredcites →https://doi.org/10.1109/sfcs.1983.35openalex-snapshot
Monte-Carlo algorithms for enumeration and reliability problems
inferredcites →https://doi.org/10.1109/simsym.2000.844922openalex-snapshot
Sequential dynamical systems and applications to simulations
inferredcites →https://doi.org/10.1112/s0024609397343616openalex-snapshot
DYNAMICAL SYSTEMS: STABILITY, SYMBOLIC DYNAMICS AND CHAOS
inferredcites →https://doi.org/10.1137/0208032openalex-snapshot
The Complexity of Enumeration and Reliability Problems
inferredcites →https://doi.org/10.1137/0222066openalex-snapshot
Polynomial-Time Approximation Algorithms for the Ising Model
inferredcites →https://doi.org/10.1137/s0097539793304601openalex-snapshot
The Complexity of Planar Counting Problems
inferredcites →https://doi.org/10.1137/s0097539797321602openalex-snapshot
The Complexity of Counting in Sparse, Regular, and Planar Graphs
inferredcites →https://doi.org/10.1142/s0129054106004339openalex-snapshot
ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS
inferredcites →https://doi.org/10.1145/335305.335316openalex-snapshot
Statistical mechanics, three-dimensionality and NP-completeness
inferredcites →https://doi.org/10.1162/neco.1993.5.5.812openalex-snapshot
Attraction Radii in Binary Hopfield Nets are Hard to Compute
inferredcites →https://doi.org/10.46298/dmtcs.2294openalex-snapshot
Gardens of Eden and Fixed Points in Sequential Dynamical Systems
inferredcites →https://doi.org/10.46298/dmtcs.2314openalex-snapshot
Predecessor and Permutation Existence Problems for Sequential Dynamical Systems.
inferredcites →https://doi.org/10.5860/choice.32-2182openalex-snapshot
Cellular automata and complexity: collected papers
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-65347-7_45openalex-snapshot
Evolution of Similar Configurations in Graph Dynamical Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-67318-5_23openalex-snapshot
On Efficiency and Predictability of the Dynamics of Discrete-Time Boolean Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-30000-9_45openalex-snapshot
Reachability in Resource-Bounded Reaction Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-47103-7_7openalex-snapshot
On Simple Models of Associative Memory: Network Density Is Not Required for Provably Complex Behavior
inferred← citeshttps://doi.org/10.1007/978-3-319-64635-0_8openalex-snapshot
Boolean Network Models of Collective Dynamics of Open and Closed Large-Scale Multi-agent Systems
inferred← citeshttps://doi.org/10.1007/s12572-018-0237-6openalex-snapshot
Graphical dynamical systems and their applications to bio-social systems
inferred← citeshttps://doi.org/10.1007/s41745-021-00260-2openalex-snapshot
Agent-Based Computational Epidemiological Modeling
inferred← citeshttps://doi.org/10.5555/2772879.2773343openalex-snapshot
Analysis Problems for Graphical Dynamical Systems: A Unified Approach Through Graph Predicates
inferred← citeshttps://doi.org/10.5555/3091125.3091195openalex-snapshot
Phase Transitions in Possible Dynamics of Cellular and Graph Automata Models of Sparsely Interconnected Multi-Agent Systems
inferred← citeshttps://doi.org/10.65109/lrxi1854openalex-snapshot
Testing Phase Space Properties of Synchronous Dynamical Systems with Nested Canalyzing Local Functions
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.