@InProceedings{dawar_et_al:LIPIcs.MFCS.2021.37,
author = {Dawar, Anuj and Vagnozzi, Danny},
title = {{On the Relative Power of Linear Algebraic Approximations of Graph Isomorphism}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {37:1--37:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.37},
URN = {urn:nbn:de:0030-drops-144774},
doi = {10.4230/LIPIcs.MFCS.2021.37},
annote = {Keywords: Graph isomorphism, proof complexity, invertible map tests}
}