Pages that link to "Item:Q2119407"
From MaRDI portal
The following pages link to Complexity of fixed point counting problems in Boolean networks (Q2119407):
Displaying 8 items.
- Complexity of limit-cycle problems in Boolean networks (Q831798) (← links)
- Computing maximal and minimal trap spaces of Boolean networks (Q2003486) (← links)
- Complexity of local, global and universality properties in finite dynamical systems (Q2104128) (← links)
- Dichotomy results for fixed point counting in Boolean dynamical systems (Q2257296) (← links)
- Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs (Q2407103) (← links)
- Maximum number of fixed points in AND-OR-NOT networks (Q2453540) (← links)
- Synchronizing Boolean networks asynchronously (Q6098155) (← links)
- Counting fixed points and pure 2-cycles of tree cellular automata (Q6547960) (← links)