Complexity of Maximum Fixed Point Problem in Boolean Networks

Florian Bridoux 1 Nicolas Durbec 2 Kévin Perrot 1 Adrien Richard 3
1 LIF - Laboratoire d'informatique Fondamentale de Marseille
2 LIS - Laboratoire d'Informatique et Systèmes
3 Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe BIOINFO
Laboratoire I3S - MDSC - Modèles Discrets pour les Systèmes Complexes
Document type :
Conference papers
Complete list of metadatas
https://hal.archives-ouvertes.fr/hal-02403974
Contributor : Adrien Richard <>
Submitted on : Wednesday, December 11, 2019 - 9:33:39 AM
Last modification on : Thursday, January 23, 2020 - 6:22:10 PM

Identifiers

Collections

I3S | EC-MARSEILLE | LIF | UNICE | UNIV-COTEDAZUR | LIS-LAB | UNIV-TLN | UNIV-AMU | CNRS

Citation

Florian Bridoux, Nicolas Durbec, Kévin Perrot, Adrien Richard. Complexity of Maximum Fixed Point Problem in Boolean Networks. Computing with Foresight and Industry, 15th Conference on Computability in Europe, CiE 2019, Jul 2019, Durham, United Kingdom. pp.132-143, ⟨10.1007/978-3-030-22996-2_12⟩. ⟨hal-02403974⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

25

Contact

Informations

CCSD