Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Scaling of running time of quantum adiabatic algorithm for propositional
  satisfiability   We numerically study quantum adiabatic algorithm for the propositional
satisfiability. A new class of previously unknown hard instances is identified
among random problems. We numerically find that the running time for such
instances grows exponentially with their size. Worst case complexity of quantum
adiabatic algorithm therefore seems to be exponential.

20
The categories of this paper are: acc-phys
10
The categories of this paper are: q-bio
22
The categories of this paper are: chao-dyn
34
The categories of this paper are: chem-ph
31
The categories of this paper are: ao-sci
26
The categories of this paper are: bayes-an
1
The categories of this paper are: cs
18
The categories of this paper are: econ
2
The categories of this paper are: math
9
The categories of this paper are: nlin
12
The categories of this paper are: nucl-th
8
The categories of this paper are: hep-ex
24
The categories of this paper are: dg-ga
30
The categories of this paper are: q-alg
29
The categories of this paper are: funct-an
19
The categories of this paper are: eess