@InProceedings{bringmann_et_al:LIPIcs.CPM.2017.12,
author = {Bringmann, Karl and Wellnitz, Philip},
title = {{Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {12:1--12:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.12},
URN = {urn:nbn:de:0030-drops-73329},
doi = {10.4230/LIPIcs.CPM.2017.12},
annote = {Keywords: conditional lower bounds, k-Clique, parsing, tree-adjoining grammars}
}