Synchronous dynamical systems on directed acyclic graphs: complexity and algorithms
From MaRDI portal
Cites work
- A characterization of nested canalyzing functions with maximum average sensitivity
- Anonymous games with binary actions
- Approximate Nash equilibria in anonymous games
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Complexity of reachability problems for finite discrete dynamical systems
- Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs
- Control of Boolean networks: hardness results and algorithms for tree structured networks
- scientific article; zbMATH DE number 5852793 (Why is no real title available?)
- scientific article; zbMATH DE number 4201618 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Introduction to algorithms.
- Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems
- Networks, crowds and markets. Reasoning about a highly connected world.
- On the computational power of discrete Hopfield nets
- Predecessor existence problems for finite discrete dynamical systems
- PSPACE SURVIVES CONSTANT-WIDTH BOTTLENECKS
- Social and economic networks.
- Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions
This page was built for publication: Synchronous dynamical systems on directed acyclic graphs: complexity and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7022386)
