Pages that link to "Item:Q3455244"
From MaRDI portal
The following pages link to Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory (Q3455244):
Displaying 12 items.
- Simple dynamics on graphs (Q266275) (← links)
- Positive and negative cycles in Boolean networks (Q1717061) (← links)
- On the flora of asynchronous locally non-monotonic Boolean automata networks (Q1744360) (← links)
- Fixed points and connections between positive and negative cycles in Boolean networks (Q1752437) (← links)
- On the rank and periodic rank of finite dynamical systems (Q1784274) (← links)
- Complexity of fixed point counting problems in Boolean networks (Q2119407) (← links)
- Fixed points in conjunctive networks and maximal independent sets in graph contractions (Q2361351) (← links)
- Asynchronous Simulation of Boolean Networks by Monotone Boolean Networks (Q4571180) (← links)
- Finite Dynamical Systems, Hat Games, and Coding Theory (Q4578011) (← links)
- Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks (Q5348493) (← links)
- On the influence of the interaction graph on a finite dynamical system (Q6151155) (← links)
- The maximal coordination principle in regulatory Boolean networks (Q6152183) (← links)
