Complexity of fixed point counting problems in Boolean networks

From MaRDI portal
Publication:2119407

DOI10.1016/j.jcss.2022.01.004zbMath1483.68240arXiv2012.02513OpenAlexW3111725170MaRDI QIDQ2119407

Adrien Richard, Kévin Perrot, Florian Bridoux, Amélia Durbec

Publication date: 29 March 2022

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.02513




Related Items (2)


Uses Software



Cites Work




This page was built for publication: Complexity of fixed point counting problems in Boolean networks