For every fixed k ≥ 2 the cyclic attractor detection problem is NP-complete precisely when the local Boolean function class contains majority-like self-dual rules or mixed conjunctive-disjunctive monotone families, and polynomial-time solvable in all other Post classes.
Boolean Formalization of Genetic Control Circuits
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Defines MR-networks and MRL logic to model regulated biochemical reactions, establish validities, express properties like reachability and attractors, and provide model-checking and bisimulation results.
citing papers explorer
-
Cyclic Attractor Detection in Boolean Network Dynamics under Local Logical Constraints
For every fixed k ≥ 2 the cyclic attractor detection problem is NP-complete precisely when the local Boolean function class contains majority-like self-dual rules or mixed conjunctive-disjunctive monotone families, and polynomial-time solvable in all other Post classes.
-
Modulation-Reaction Networks
Defines MR-networks and MRL logic to model regulated biochemical reactions, establish validities, express properties like reachability and attractors, and provide model-checking and bisimulation results.