Login / Signup

Computational complexity of finite asynchronous cellular automata.

Alberto DennunzioEnrico FormentiLuca ManzoniGiancarlo MauriAntonio E. Porreca
Published in: Theor. Comput. Sci. (2017)
Keyphrases
  • asynchronous cellular automata
  • computational complexity
  • pattern formation
  • special case
  • np complete
  • image analysis
  • cellular automata
  • potential field