n) lower bound for finding a longest increasing subsequence

Prakash Ramanan. n) lower bound for finding a longest increasing subsequence. Int. J. Comput. Math., 65(3-4):161-164, 1997. [doi]

Authors

Prakash Ramanan

This author has not been identified. Look up 'Prakash Ramanan' in Google