## On computational complexity of counting fixed points in symmetric boolean graph automata (2005)

by
Predrag T. Tosić
,
Gul A. Agha

Venue: | IN PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON UNCONVENTIONAL COMPUTATION (UC’05), VOLUME 3699 OF LECTURE NOTES IN COMPUTER SCIENCE |

Citations: | 1 - 0 self |