Login / Signup
On the Complexity of Counting Fixed Points and Gardens of Eden in Sequential Dynamical Systems on Planar Bipartite Graphs.
Predrag T. Tosic
Published in:
Int. J. Found. Comput. Sci. (2006)
Keyphrases
</>
dynamical systems
fixed point
bipartite graph
differential equations
maximum matching
partially observable
worst case
link prediction
nonlinear dynamical systems
predictive state representations
objective function
computational complexity
state space
stationary points