Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: From k-SAT to k-CSP: Two Generalized Algorithms   Constraint satisfaction problems (CSPs) models many important intractable
NP-hard problems such as propositional satisfiability problem (SAT). Algorithms
with non-trivial upper bounds on running time for restricted SAT with bounded
clause length k (k-SAT) can be classified into three styles: DPLL-like,
PPSZ-like and Local Search, with local search algorithms having already been
generalized to CSP with bounded constraint arity k (k-CSP). We generalize a
DPLL-like algorithm in its simplest form and a PPSZ-like algorithm from k-SAT
to k-CSP. As far as we know, this is the first attempt to use PPSZ-like
strategy to solve k-CSP, and before little work has been focused on the
DPLL-like or PPSZ-like strategies for k-CSP.

2
The categories of this paper are: math
9
The categories of this paper are: nlin
29
The categories of this paper are: funct-an
10
The categories of this paper are: q-bio
30
The categories of this paper are: q-alg
22
The categories of this paper are: chao-dyn
15
The categories of this paper are: nucl-ex
13
The categories of this paper are: quant-ph
26
The categories of this paper are: bayes-an
24
The categories of this paper are: dg-ga
0
The categories of this paper are: hep-ph
31
The categories of this paper are: ao-sci
12
The categories of this paper are: nucl-th
23
The categories of this paper are: solv-int
5
The categories of this paper are: gr-qc
36
The categories of this paper are: cmp-lg