Prakash Ramanan. n) lower bound for finding a longest increasing subsequence. Int. J. Comput. Math., 65(3-4):161-164, 1997. [doi]
@article{Ramanan97-0,
title = {n) lower bound for finding a longest increasing subsequence},
author = {Prakash Ramanan},
year = {1997},
doi = {10.1080/00207169708804607},
url = {https://doi.org/10.1080/00207169708804607},
researchr = {https://researchr.org/publication/Ramanan97-0},
cites = {0},
citedby = {0},
journal = {Int. J. Comput. Math.},
volume = {65},
number = {3-4},
pages = {161-164},
}