Complexity of maximum fixed point problem in Boolean networks

DOI10.1007/978-3-030-22996-2_12zbMath1434.37013OpenAlexW2953777809MaRDI QIDQ2179355

Kévin Perrot, Florian Bridoux, Nicolas Durbec, Adrien Richard

Publication date: 12 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-22996-2_12

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Fixed points and periodic points of dynamical systems; fixed-point index theory; local dynamics (37C25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Dynamical systems involving maps of trees and graphs (37E25)

Related Items (5)

Complexity of fixed point counting problems in Boolean networks ⋮ Complexity of limit-cycle problems in Boolean networks ⋮ Counting periodic points in parallel graph dynamical systems ⋮ Optimising attractor computation in Boolean automata networks ⋮ Existence, coexistence and uniqueness of fixed points in parallel and sequential dynamical systems over directed graphs

This page was built for publication: Complexity of maximum fixed point problem in Boolean networks