English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-And-Solve

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

Abboud, A., Backurs, A., Bringmann, K., & Künnemann, M. (2017). Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-And-Solve. In 58th Annual IEEE Symposium on Foundations of Computer Science (pp. 192-203). Piscataway, NJ: IEEE. doi:10.1109/FOCS.2017.26.


Cite as: http://hdl.handle.net/21.11116/0000-0000-0475-8
Abstract
There is no abstract available