"The Complexity of Computations in Recurrent Boolean Networks."

Serge Shumsky (1996)

> Home

Details and statistics

DOI: —

access: closed

type: Journal Article

metadata version: 2020-09-11

- view
  - electronic edition @ complex-systems.com
- export record
  dblp key:
  - journals/compsys/Shumsky96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/compsys/Shumsky96
Serge Shumsky:
The Complexity of Computations in Recurrent Boolean Networks. Complex Syst. 10(2) (1996)

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.