Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Tight Lower Bounds for the Longest Common Extension Problem   The longest common extension problem is to preprocess a given string of
length $n$ into a data structure that uses $S(n)$ bits on top of the input and
answers in $T(n)$ time the queries $\mathit{LCE}(i,j)$ computing the length of
the longest string that occurs at both positions $i$ and $j$ in the input. We
prove that the trade-off $S(n)T(n) = \Omega(n\log n)$ holds in the non-uniform
cell-probe model provided that the input string is read-only, each letter
occupies a separate memory cell, $S(n) = \Omega(n)$, and the size of the input
alphabet is at least $2^{8\lceil S(n) / n\rceil}$. It is known that this
trade-off is tight.

20
The categories of this paper are: acc-phys
30
The categories of this paper are: q-alg
3
The categories of this paper are: physics
26
The categories of this paper are: bayes-an
37
The categories of this paper are: supr-con
33
The categories of this paper are: plasm-ph
21
The categories of this paper are: adap-org
17
The categories of this paper are: q-fin
19
The categories of this paper are: eess
9
The categories of this paper are: nlin
32
The categories of this paper are: atom-ph
34
The categories of this paper are: chem-ph
13
The categories of this paper are: quant-ph
5
The categories of this paper are: gr-qc
35
The categories of this paper are: mtrl-th
36
The categories of this paper are: cmp-lg