"On the complexity of enumerating possible dynamics of sparsely connected ..."

Predrag T. Tosic (2010)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2020-01-15

- view
  - electronic edition @ episciences.org (open access)
- export record
  dblp key:
  - conf/automata/Tosic10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/automata/Tosic10
Predrag T. Tosic:
On the complexity of enumerating possible dynamics of sparsely connected Boolean network automata with simple update rules. Automata 2010: 125-144

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.