Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Simple average-case lower bounds for approximate near-neighbor from
  isoperimetric inequalities   We prove an $\Omega(d/\log \frac{sw}{nd})$ lower bound for the average-case
cell-probe complexity of deterministic or Las Vegas randomized algorithms
solving approximate near-neighbor (ANN) problem in $d$-dimensional Hamming
space in the cell-probe model with $w$-bit cells, using a table of size $s$.
This lower bound matches the highest known worst-case cell-probe lower bounds
for any static data structure problems.
  This average-case cell-probe lower bound is proved in a general framework
which relates the cell-probe complexity of ANN to isoperimetric inequalities in
the underlying metric space. A tighter connection between ANN lower bounds and
isoperimetric inequalities is established by a stronger richness lemma proved
by cell-sampling techniques.

4
The categories of this paper are: cond-mat
16
The categories of this paper are: stat
22
The categories of this paper are: chao-dyn
18
The categories of this paper are: econ
33
The categories of this paper are: plasm-ph
20
The categories of this paper are: acc-phys
36
The categories of this paper are: cmp-lg
15
The categories of this paper are: nucl-ex
12
The categories of this paper are: nucl-th
8
The categories of this paper are: hep-ex
19
The categories of this paper are: eess
7
The categories of this paper are: hep-th
31
The categories of this paper are: ao-sci
30
The categories of this paper are: q-alg
37
The categories of this paper are: supr-con
6
The categories of this paper are: astro-ph