Complexity of maximum fixed point problem in Boolean networks
DOI10.1007/978-3-030-22996-2_12zbMATH Open1434.37013OpenAlexW2953777809MaRDI QIDQ2179355FDOQ2179355
Authors: Florian Bridoux, Nicolas Durbec, Kévin Perrot, Adrien Richard 
Publication date: 12 May 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-22996-2_12
Recommendations
- Complexity of fixed point counting problems in Boolean networks
- Maximum number of fixed points in regulatory Boolean networks
- On the computation of fixed points in Boolean networks
- Fixed points of Boolean networks with small number of elementary circuits
- Fixed points and connections between positive and negative cycles in Boolean networks
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Fixed points and periodic points of dynamical systems; fixed-point index theory; local dynamics (37C25) Dynamical systems involving maps of trees and graphs (37E25)
Cited In (11)
- Counting periodic points in parallel graph dynamical systems
- Design of fixed points in Boolean networks using feedback vertex sets and model reduction
- Complexity of limit-cycle problems in Boolean networks
- Fixed points and maximal independent sets in AND-OR networks
- Maximum number of fixed points in AND-OR-NOT networks
- Maximum number of fixed points in regulatory Boolean networks
- Optimising attractor computation in Boolean automata networks
- Computing maximal and minimal trap spaces of Boolean networks
- Existence, coexistence and uniqueness of fixed points in parallel and sequential dynamical systems over directed graphs
- Complexity of fixed point counting problems in Boolean networks
- On the computation of fixed points in Boolean networks
This page was built for publication: Complexity of maximum fixed point problem in Boolean networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2179355)
