O(n²) for Longest Common Weakly Increasing Subsequence?">O(n²) for Longest Common Weakly Increasing Subsequence?, dblp, computer science, bibliography, knowledge graph, author, editor, publication, conference, journal, book, thesis, database, collection, open data, bibtex">

More Web Proxy on the site http://driver.im/

default search action

combined dblp search
author search
venue search
publication search

ask others

"Why is it hard to beat O(n2) for Longest Common ..."

Adam Polak (2018)

> Home

Details and statistics

DOI: 10.1016/J.IPL.2017.11.007

access: closed

type: Journal Article

metadata version: 2022-08-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/Polak18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/Polak18
Adam Polak:
Why is it hard to beat O(n²) for Longest Common Weakly Increasing Subsequence? Inf. Process. Lett. 132: 1-5 (2018)

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.