Complexity of Maximum Fixed Point Problem in Boolean Networks - Archive ouverte HAL Access content directly
Conference Papers Year : 2019
No file

Dates and versions

hal-02403974 , version 1 (11-12-2019)

Identifiers

Cite

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⟩
86 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More