"Tight Ω(n lg n) lower bound for finding a longest ..."

Prakash Ramanan (1997)

> Home

Details and statistics

DOI: 10.1080/00207169708804607

access: closed

type: Journal Article

metadata version: 2019-05-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijcm/Ramanan97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijcm/Ramanan97
Prakash Ramanan:
Tight Ω(n lg n) lower bound for finding a longest increasing subsequence. Int. J. Comput. Math. 65(3-4): 161-164 (1997)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.