Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Complexity theoretic limitations on learning DNF's   Using the recently developed framework of [Daniely et al, 2014], we show that
under a natural assumption on the complexity of refuting random K-SAT formulas,
learning DNF formulas is hard. Furthermore, the same assumption implies the
hardness of learning intersections of $\omega(\log(n))$ halfspaces,
agnostically learning conjunctions, as well as virtually all (distribution
free) learning problems that were previously shown hard (under complexity
assumptions).

14
The categories of this paper are: math-ph
16
The categories of this paper are: stat
8
The categories of this paper are: hep-ex
33
The categories of this paper are: plasm-ph
2
The categories of this paper are: math
30
The categories of this paper are: q-alg
21
The categories of this paper are: adap-org
28
The categories of this paper are: alg-geom
5
The categories of this paper are: gr-qc
12
The categories of this paper are: nucl-th
31
The categories of this paper are: ao-sci
18
The categories of this paper are: econ
23
The categories of this paper are: solv-int
11
The categories of this paper are: hep-lat
26
The categories of this paper are: bayes-an
37
The categories of this paper are: supr-con