Complexity of fixed point counting problems in Boolean networks (Q2119407): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:35, 1 February 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
