External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Complexity of Maximum Fixed Point Problem in Boolean Networks

Florian Bridoux, Nicolas Durbec, Kévin Perrot, Adrien Richard. Complexity of Maximum Fixed Point Problem in Boolean Networks. In Florin Manea, Barnaby Martin, Daniël Paulusma, Giuseppe Primiero, editors, Computing with Foresight and Industry - 15th Conference on Computability in Europe, CiE 2019, Durham, UK, July 15-19, 2019, Proceedings. Volume 11558 of Lecture Notes in Computer Science, pages 132-143, Springer, 2019. [doi]

Authors

Florian Bridoux

This author has not been identified. Look up 'Florian Bridoux' in Google

Nicolas Durbec

This author has not been identified. Look up 'Nicolas Durbec' in Google

Kévin Perrot

This author has not been identified. Look up 'Kévin Perrot' in Google

Adrien Richard

This author has not been identified. Look up 'Adrien Richard' in Google
runs on