@InProceedings{coregliano_et_al:LIPIcs.ITCS.2023.40,
author = {Coregliano, Leonardo Nagami and Jeronimo, Fernando Granha and Jones, Chris},
title = {{Exact Completeness of LP Hierarchies for Linear Codes}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {40:1--40:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.40},
URN = {urn:nbn:de:0030-drops-175433},
doi = {10.4230/LIPIcs.ITCS.2023.40},
annote = {Keywords: LP bound, linear codes, Delsarte’s LP, combinatorial polytopes, pseudoexpectation}
}