Complexity of Limit-Cycle Problems in Boolean Networks

Florian Bridoux, Caroline Gaze-Maillot, Kévin Perrot, Sylvain Sené

Open source

DOI
10.1007/978-3-030-67731-2_10
Published
2021-01-11
Container
Not recorded
Publisher
Springer International Publishing
Open access
yes

Credibility signals

uncertain Score 51/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1007/978-3-030-67731-2_10,
  title = {Complexity of Limit-Cycle Problems in Boolean Networks},
  author = {Florian Bridoux and Caroline Gaze-Maillot and Kévin Perrot and Sylvain Sené},
  year = {2021},
  doi = {10.1007/978-3-030-67731-2_10},
  url = {https://doi.org/10.1007/978-3-030-67731-2_10}
}

RIS

TY  - JOUR
TI  - Complexity of Limit-Cycle Problems in Boolean Networks
AU  - Florian Bridoux
AU  - Caroline Gaze-Maillot
AU  - Kévin Perrot
AU  - Sylvain Sené
PY  - 2021
DO  - 10.1007/978-3-030-67731-2_10
UR  - https://doi.org/10.1007/978-3-030-67731-2_10
ER  - 

APA

Bridoux, F., Gaze-Maillot, C., Perrot, K., & Sené, S. (2021). Complexity of Limit-Cycle Problems in Boolean Networks. https://doi.org/10.1007/978-3-030-67731-2_10

Source records