On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata.

Predrag T. Tosic Gul A. Agha

Published in: UC (2005)

Keyphrases

fixed point
computational complexity
closure operator
sufficient conditions
approximate value iteration
dynamical systems
boolean functions
special case
belief propagation
np complete
free energy
stationary points
linear logic
asymptotic properties
post processing
temporal difference learning
dynamic programming