Complexity of fixed point counting problems in Boolean networks (Q2119407): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jcss.2022.01.004 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JCSS.2022.01.004 / rank | |||
Normal rank | |||
Latest revision as of 03:08, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of fixed point counting problems in Boolean networks |
scientific article |
Statements
Complexity of fixed point counting problems in Boolean networks (English)
0 references
29 March 2022
0 references
complexity
0 references
Boolean networks
0 references
fixed points
0 references
interaction graph
0 references
0 references
0 references
