On computational complexity of counting fixed points in symmetric boolean graph automata

Predrag T. Tošić, Gui A. Agha

Research output: Contribution to journal › Conference article › peer-review

Fingerprint

Dive into the research topics of 'On computational complexity of counting fixed points in symmetric boolean graph automata'. Together they form a unique fingerprint.

Keyphrases

Computer Science

Mathematics