"Tight Conditional Lower Bounds for Longest Common Increasing Subsequence."

Lech Duraj, Marvin Künnemann, Adam Polak (2019)

> Home

Details and statistics

DOI: 10.1007/S00453-018-0485-7

access: open

type: Journal Article

metadata version: 2019-10-31

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/algorithmica/DurajKP19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/DurajKP19
Lech Duraj, Marvin Künnemann, Adam Polak:
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence. Algorithmica 81(10): 3968-3992 (2019)

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.