Complexity of limit-cycle problems in Boolean networks

DOI10.1007/978-3-030-67731-2_10zbMath1490.68117arXiv2001.07391OpenAlexW3126498632MaRDI QIDQ831798

Sylvain Sené, Caroline Gaze-Maillot, Florian Bridoux, Kévin Perrot

Publication date: 24 March 2022

Full work available at URL: https://arxiv.org/abs/2001.07391

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Dynamical systems in biology (37N25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Dynamical systems involving maps of trees and graphs (37E25)

Related Items

Complexity of fixed point counting problems in Boolean networks, Existence and non existence of limit cycles in Boolean networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorics of Boolean automata circuits dynamics
• Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework
• Negative circuits and sustained oscillations in asynchronous automata networks
• Itérations sur des ensembles finis et automates cellulaires contractants
• Limit cycles and update digraphs in Boolean networks
• Fixed points and maximal independent sets in AND-OR networks
• On the number of different dynamics in Boolean networks with deterministic update schedules
• Complexity of maximum fixed point problem in Boolean networks
• Necessary conditions for multistationarity in discrete dynamical systems
• Blocs-H-matrices et convergence des méthodes itératives classiques par blocs
• Neural networks and complexity theory
• Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks
• A logical calculus of the ideas immanent in nervous activity