2 search results - page 1 / 1 » On Computational Complexity of Counting Fixed Points in Symm... |
UC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
BIRTHDAY
2010
Springer
13 years 5 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...