Complexity of fixed point counting problems in Boolean networks (Q2119407): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 2012.02513 / rank | |||
Normal rank | |||
Revision as of 01:09, 19 April 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
