English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Multivariate Fine-Grained Complexity of Longest Common Subsequence

MPS-Authors
/persons/resource/persons44182

Bringmann,  Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44857

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

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Bringmann, K., & Künnemann, M. (2018). Multivariate Fine-Grained Complexity of Longest Common Subsequence. In A. Czumaj (Ed.), SODA'18 (pp. 1216-1235). Philadelphia, PA: SIAM. doi:10.1137/1.9781611975031.79.


Cite as: http://hdl.handle.net/21.11116/0000-0000-3F0E-C
Abstract
There is no abstract available