@InProceedings{roberson_et_al:LIPIcs.ICALP.2023.101,
author = {Roberson, David E. and Seppelt, Tim},
title = {{Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {101:1--101:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.101},
URN = {urn:nbn:de:0030-drops-181531},
doi = {10.4230/LIPIcs.ICALP.2023.101},
annote = {Keywords: Lasserre hierarchy, homomorphism indistinguishability, Sherali-Adams hierarchy, treewidth, semidefinite programming, linear programming, graph isomorphism}
}