Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Short Proof that the Extension Complexity of the Correlation Polytope
  Grows Exponentially   We establish that the extension complexity of the nXn correlation polytope is
at least 1.5^n by a short proof that is self-contained except for using the
fact that every face of a polyhedron is the intersection of all facets it is
contained in. The main innovative aspect of the proof is a simple combinatorial
argument showing that the rectangle covering number of the unique-disjointness
matrix is at least 1.5^n, and thus the nondeterministic communication
complexity of the unique-disjointness predicate is at least .58n. We thereby
slightly improve on the previously best known lower bounds 1.24^n and .31n,
respectively.

20
The categories of this paper are: acc-phys
11
The categories of this paper are: hep-lat
15
The categories of this paper are: nucl-ex
19
The categories of this paper are: eess
35
The categories of this paper are: mtrl-th
9
The categories of this paper are: nlin
0
The categories of this paper are: hep-ph
23
The categories of this paper are: solv-int
27
The categories of this paper are: comp-gas
28
The categories of this paper are: alg-geom
30
The categories of this paper are: q-alg
17
The categories of this paper are: q-fin
18
The categories of this paper are: econ
26
The categories of this paper are: bayes-an
1
The categories of this paper are: cs
14
The categories of this paper are: math-ph