Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Tight Lower Bound for Linear Sketches of Moments   The problem of estimating frequency moments of a data stream has attracted a
lot of attention since the onset of streaming algorithms [AMS99]. While the
space complexity for approximately computing the $p^{\rm th}$ moment, for
$p\in(0,2]$ has been settled [KNW10], for $p>2$ the exact complexity remains
open. For $p>2$ the current best algorithm uses $O(n^{1-2/p}\log n)$ words of
space [AKO11,BO10], whereas the lower bound is of $\Omega(n^{1-2/p})$ [BJKS04].
  In this paper, we show a tight lower bound of $\Omega(n^{1-2/p}\log n)$ words
for the class of algorithms based on linear sketches, which store only a sketch
$Ax$ of input vector $x$ and some (possibly randomized) matrix $A$. We note
that all known algorithms for this problem are linear sketches.

28
The categories of this paper are: alg-geom
18
The categories of this paper are: econ
21
The categories of this paper are: adap-org
8
The categories of this paper are: hep-ex
3
The categories of this paper are: physics
6
The categories of this paper are: astro-ph
9
The categories of this paper are: nlin
32
The categories of this paper are: atom-ph
30
The categories of this paper are: q-alg
35
The categories of this paper are: mtrl-th
20
The categories of this paper are: acc-phys
31
The categories of this paper are: ao-sci
5
The categories of this paper are: gr-qc
25
The categories of this paper are: patt-sol
34
The categories of this paper are: chem-ph
24
The categories of this paper are: dg-ga