Tight Conditional Lower Bounds for Longest Common Increasing Subsequence

Duraj, Lech; Künnemann, Marvin; Polak, Adam

doi:10.1007/s00453-018-0485-7

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Tight Conditional Lower Bounds for Longest Common Increasing Subsequence

MPS-Authors

/persons/resource/persons44857

Künnemann, Marvin
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

Duraj2018_Article_TightConditionalLowerBoundsFor.pdf
(Publisher version), 487KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Duraj, L., Künnemann, M., & Polak, A. (2019). Tight Conditional Lower Bounds for Longest Common Increasing Subsequence. Algorithmica, 81(10), 3968-3992. doi:10.1007/s00453-018-0485-7.

Cite as: https://hdl.handle.net/21.11116/0000-0002-A906-9

Abstract

There is no abstract available