Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Weaker consistency notions for all the CSPs of bounded width   The characterization of all the Constraint Satisfaction Problems of bounded
width, proposed by Feder and Vardi [SICOMP'98], was confirmed in [Bulatov'09]
and independently in [FOCS'09, JACM'14]. Both proofs are based on the
(2,3)-consistency (using Prague consistency in [FOCS'09], directly in
[Bulatov'09]) which is costly to verify.
  We introduce a new consistency notion, Singleton Linear Arc Consistency
(SLAC), and show that it solves the same family of problems. SLAC is weaker
than Singleton Arc Consistency (SAC) and thus the result answers the question
from [JLC'13] by showing that SAC solves all the problems of bounded width. At
the same time the problem of verifying weaker consistency (even SAC) offers
significant computational advantages over the problem of verifying
(2,3)-consistency which improves the algorithms solving the CSPs of bounded
width.

16
The categories of this paper are: stat
35
The categories of this paper are: mtrl-th
14
The categories of this paper are: math-ph
24
The categories of this paper are: dg-ga
31
The categories of this paper are: ao-sci
29
The categories of this paper are: funct-an
25
The categories of this paper are: patt-sol
28
The categories of this paper are: alg-geom
23
The categories of this paper are: solv-int
21
The categories of this paper are: adap-org
2
The categories of this paper are: math
4
The categories of this paper are: cond-mat
18
The categories of this paper are: econ
36
The categories of this paper are: cmp-lg
27
The categories of this paper are: comp-gas
11
The categories of this paper are: hep-lat