Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Beating the random assignment on constraint satisfaction problems of
  bounded degree   We show that for any odd $k$ and any instance of the Max-kXOR constraint
satisfaction problem, there is an efficient algorithm that finds an assignment
satisfying at least a $\frac{1}{2} + \Omega(1/\sqrt{D})$ fraction of
constraints, where $D$ is a bound on the number of constraints that each
variable occurs in. This improves both qualitatively and quantitatively on the
recent work of Farhi, Goldstone, and Gutmann (2014), which gave a
\emph{quantum} algorithm to find an assignment satisfying a $\frac{1}{2} +
\Omega(D^{-3/4})$ fraction of the equations.
  For arbitrary constraint satisfaction problems, we give a similar result for
"triangle-free" instances; i.e., an efficient algorithm that finds an
assignment satisfying at least a $\mu + \Omega(1/\sqrt{D})$ fraction of
constraints, where $\mu$ is the fraction that would be satisfied by a uniformly
random assignment.

36
The categories of this paper are: cmp-lg
29
The categories of this paper are: funct-an
35
The categories of this paper are: mtrl-th
6
The categories of this paper are: astro-ph
33
The categories of this paper are: plasm-ph
24
The categories of this paper are: dg-ga
11
The categories of this paper are: hep-lat
0
The categories of this paper are: hep-ph
2
The categories of this paper are: math
5
The categories of this paper are: gr-qc
22
The categories of this paper are: chao-dyn
9
The categories of this paper are: nlin
4
The categories of this paper are: cond-mat
15
The categories of this paper are: nucl-ex
12
The categories of this paper are: nucl-th
19
The categories of this paper are: eess