Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Inapproximability of VC Dimension and Littlestone's Dimension   We study the complexity of computing the VC Dimension and Littlestone's
Dimension. Given an explicit description of a finite universe and a concept
class (a binary matrix whose $(x,C)$-th entry is $1$ iff element $x$ belongs to
concept $C$), both can be computed exactly in quasi-polynomial time ($n^{O(\log
n)}$). Assuming the randomized Exponential Time Hypothesis (ETH), we prove
nearly matching lower bounds on the running time, that hold even for
approximation algorithms.

23
The categories of this paper are: solv-int
0
The categories of this paper are: hep-ph
7
The categories of this paper are: hep-th
11
The categories of this paper are: hep-lat
32
The categories of this paper are: atom-ph
10
The categories of this paper are: q-bio
29
The categories of this paper are: funct-an
20
The categories of this paper are: acc-phys
14
The categories of this paper are: math-ph
30
The categories of this paper are: q-alg
6
The categories of this paper are: astro-ph
12
The categories of this paper are: nucl-th
4
The categories of this paper are: cond-mat
8
The categories of this paper are: hep-ex
31
The categories of this paper are: ao-sci
16
The categories of this paper are: stat