Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Searching for feasible stationary states in reaction networks by solving
  a Boolean constraint satisfaction problem   We analyze the solutions, on single network instances, of a recently
introduced class of constraint-satisfaction problems (CSPs), describing
feasible steady states of chemical reaction networks. First, we show that the
CSPs generalize the scheme known as Network Expansion, which is recovered in a
specific limit. Next, a full statistical mechanics characterization (including
the phase diagram and a discussion of physical origin of the phase transitions)
for Network Expansion is obtained. Finally, we provide a message-passing
algorithm to solve the original CSPs in the most general form.

16
The categories of this paper are: stat
34
The categories of this paper are: chem-ph
2
The categories of this paper are: math
15
The categories of this paper are: nucl-ex
30
The categories of this paper are: q-alg
1
The categories of this paper are: cs
14
The categories of this paper are: math-ph
26
The categories of this paper are: bayes-an
8
The categories of this paper are: hep-ex
36
The categories of this paper are: cmp-lg
22
The categories of this paper are: chao-dyn
17
The categories of this paper are: q-fin
19
The categories of this paper are: eess
13
The categories of this paper are: quant-ph
24
The categories of this paper are: dg-ga
35
The categories of this paper are: mtrl-th