The following pages link to Florian Bridoux (Q831796):
Displaying 14 items.
- Complexity of limit-cycle problems in Boolean networks (Q831798) (← links)
- Expansive automata networks (Q2003992) (← links)
- Commutative automata networks (Q2038014) (← links)
- Sequentialization and procedural complexity in automata networks (Q2055976) (← links)
- On simulation in automata networks (Q2106612) (← links)
- Complexity of fixed point counting problems in Boolean networks (Q2119407) (← links)
- Complexity of maximum fixed point problem in Boolean networks (Q2179355) (← links)
- Complete simulation of automata networks (Q2301357) (← links)
- On the Cost of Simulating a Parallel Boolean Automata Network by a Block-Sequential One (Q2988816) (← links)
- Interaction graphs of isomorphic automata networks. I: Complete digraph and minimum in-degree (Q6133643) (← links)
- Asynchronous dynamics of isomorphic Boolean networks (Q6520399) (← links)
- Complexity of limit cycles with block-sequential update schedules in conjunctive networks (Q6535747) (← links)
- Dividing permutations in the semiring of functional digraphs (Q6637840) (← links)
- Interaction graphs of isomorphic automata networks II: universal dynamics (Q6744179) (← links)
