Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Clique and Vertex Cover are solvable in polynomial time if the input
  structure is ordered and contains a successor predicate   In this manuscript, assuming that Graedel's 1991 results are correct (which
implies that bounds on the solution values for optimization problems can be
expressed in existential second order logic where the first order part is
universal Horn), I will show that Clique and Vertex Cover can be solved in
polynomial time if the input structure is ordered and contains a successor
predicate. In the last section, we will argue about the validity of Graedel's
1991 results. Update: Manuscript withdrawn, because results are incorrect. If
phi = phi_1 AND phi_2, and phi is a Horn formula, it does NOT mean that both
phi_1 and phi_2 are Horn formulae. Furthermore, the cardinality constraint
CANNOT be expressed as a universal Horn sentence in ESO (NOT even when the
structure is ordered).

15
The categories of this paper are: nucl-ex
17
The categories of this paper are: q-fin
37
The categories of this paper are: supr-con
29
The categories of this paper are: funct-an
28
The categories of this paper are: alg-geom
8
The categories of this paper are: hep-ex
19
The categories of this paper are: eess
35
The categories of this paper are: mtrl-th
34
The categories of this paper are: chem-ph
18
The categories of this paper are: econ
20
The categories of this paper are: acc-phys
36
The categories of this paper are: cmp-lg
23
The categories of this paper are: solv-int
27
The categories of this paper are: comp-gas
22
The categories of this paper are: chao-dyn
7
The categories of this paper are: hep-th