@InProceedings{abboud_et_al:LIPIcs.ITCS.2018.35,
author = {Abboud, Amir and Rubinstein, Aviad},
title = {{Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {35:1--35:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.35},
URN = {urn:nbn:de:0030-drops-83490},
doi = {10.4230/LIPIcs.ITCS.2018.35},
annote = {Keywords: Distributed PCP, Longest Common Subsequence, Fine-grained Complexity, Strong Exponential Time Hypothesis}
}