Predrag T. Tosic, Gul A. Agha. On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata. In Cristian Calude, Michael J. Dinneen, Gheorghe Paun, Mario J. Pérez-Jiménez, Grzegorz Rozenberg, editors, Unconventional Computation, 4th International Conference, UC 2005, Sevilla, Spain, October 3-7, 2005, Proceedings. Volume 3699 of Lecture Notes in Computer Science, pages 191-205, Springer, 2005. [doi]
Abstract is missing.