Searching for feasible stationary states in reaction networks by solving a Boolean constraint satisfaction problem

Alessandro Seganti, Federico Ricci-Tersenghi, Andrea De Martino

We analyze the solutions, on single network instances, of a recently introduced class of constraint-satisfaction problems (CSPs), describing feasible steady states of chemical reac…