"Complexity of fixed point counting problems in Boolean networks."

Florian Bridoux et al. (2022)

> Home

Details and statistics

DOI: 10.1016/J.JCSS.2022.01.004

access: closed

type: Journal Article

metadata version: 2022-04-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jcss/BridouxDPR22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/BridouxDPR22
Florian Bridoux, Amélia Durbec, Kévin Perrot, Adrien Richard:
Complexity of fixed point counting problems in Boolean networks. J. Comput. Syst. Sci. 126: 138-164 (2022)

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.