Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A simple linear space algorithm for computing a longest common
  increasing subsequence   This paper reformulates the problem of finding a longest common increasing
subsequence of the two given input sequences in a very succinct way. An
extremely simple linear space algorithm based on the new formula can find a
longest common increasing subsequence of sizes $n$ and $m$ respectively, in
time $O(nm)$ using additional $\min\{n,m\}+1$ space.

12
The categories of this paper are: nucl-th
29
The categories of this paper are: funct-an
17
The categories of this paper are: q-fin
33
The categories of this paper are: plasm-ph
4
The categories of this paper are: cond-mat
21
The categories of this paper are: adap-org
23
The categories of this paper are: solv-int
28
The categories of this paper are: alg-geom
15
The categories of this paper are: nucl-ex
35
The categories of this paper are: mtrl-th
36
The categories of this paper are: cmp-lg
18
The categories of this paper are: econ
0
The categories of this paper are: hep-ph
32
The categories of this paper are: atom-ph
6
The categories of this paper are: astro-ph
7
The categories of this paper are: hep-th