Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Estimating Satisfiability   The problem of estimating the proportion of satisfiable instances of a given
CSP (constraint satisfaction problem) can be tackled through weighting. It
consists in putting onto each solution a non-negative real value based on its
neighborhood in a way that the total weight is at least 1 for each satisfiable
instance. We define in this paper a general weighting scheme for the estimation
of satisfiability of general CSPs. First we give some sufficient conditions for
a weighting system to be correct. Then we show that this scheme allows for an
improvement on the upper bound on the existence of non-trivial cores in 3-SAT
obtained by Maneva and Sinclair (2008) to 4.419. Another more common way of
estimating satisfiability is ordering. This consists in putting a total order
on the domain, which induces an orientation between neighboring solutions in a
way that prevents circuits from appearing, and then counting only minimal
elements. We compare ordering and weighting under various conditions.

2
The categories of this paper are: math
35
The categories of this paper are: mtrl-th
11
The categories of this paper are: hep-lat
32
The categories of this paper are: atom-ph
28
The categories of this paper are: alg-geom
20
The categories of this paper are: acc-phys
15
The categories of this paper are: nucl-ex
10
The categories of this paper are: q-bio
4
The categories of this paper are: cond-mat
18
The categories of this paper are: econ
0
The categories of this paper are: hep-ph
25
The categories of this paper are: patt-sol
24
The categories of this paper are: dg-ga
8
The categories of this paper are: hep-ex
26
The categories of this paper are: bayes-an
23
The categories of this paper are: solv-int