Complexity of Maximum Fixed Point Problem in Boolean Networks

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

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⟩

Share

Metrics

Record views

25