"Approximating the Longest Common Subsequence problem within a ..."

Negev Shekel Nosatzki (2021)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2022-01-03

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-2112-08454
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2112-08454
Negev Shekel Nosatzki:
Approximating the Longest Common Subsequence problem within a sub-polynomial factor in linear time. CoRR abs/2112.08454 (2021)

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.