Abstract: Boolean satisfiability (SAT), a non-deterministic polynomial (NP)-complete problem, has gained increasing attention with applications in artificial intelligence, machine learning, electronic ...
Abstract: The calculation of the synchronization problem is a very important topic in the research of Boolean networks (BNs). This article focuses on the study of state-flipped control on the node-set ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results