Pages that link to "Item:Q856411"

The following pages link to Complexity of reachability problems for finite discrete dynamical systems (Q856411):

Displaying 8 items.

• Attractor stability in nonuniform Boolean networks (Q475391) (← links)
• Limit cycle structure for dynamic bi-threshold systems (Q475394) (← links)
• Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems (Q549709) (← links)
• Reversible iterative graph processes (Q690472) (← links)
• Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game? (Q1024268) (← links)
• Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results (Q1711228) (← links)
• Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs (Q1729688) (← links)
• A computational study of \(f\)-reversible processes on graphs (Q1752484) (← links)