On the Complexity of Inference and Completion of Boolean Networks from Given Singleton Attractors | Publicación