Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: First-order query evaluation on structures of bounded degree   We consider the enumeration problem of first-order queries over structures of
bounded degree. It was shown that this problem is in the Constant-Delaylin
class. An enumeration problem belongs to Constant-Delaylin if for an input of
size n it can be solved by: - an O(n) precomputation phase building an index
structure, - followed by a phase enumerating the answers with no repetition and
a constant delay between two consecutive outputs. In this article we give a
different proof of this result based on Gaifman's locality theorem for
first-order logic. Moreover, the constants we obtain yield a total evaluation
time that is triply exponential in the size of the input formula, matching the
complexity of the best known evaluation algorithms.

20
The categories of this paper are: acc-phys
24
The categories of this paper are: dg-ga
21
The categories of this paper are: adap-org
31
The categories of this paper are: ao-sci
16
The categories of this paper are: stat
2
The categories of this paper are: math
27
The categories of this paper are: comp-gas
0
The categories of this paper are: hep-ph
7
The categories of this paper are: hep-th
17
The categories of this paper are: q-fin
19
The categories of this paper are: eess
36
The categories of this paper are: cmp-lg
6
The categories of this paper are: astro-ph
12
The categories of this paper are: nucl-th
8
The categories of this paper are: hep-ex
26
The categories of this paper are: bayes-an