@InProceedings{galesi_et_al:LIPIcs.CCC.2023.4,
author = {Galesi, Nicola and Grochow, Joshua A. and Pitassi, Toniann and She, Adrian},
title = {{On the Algebraic Proof Complexity of Tensor Isomorphism}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {4:1--4:40},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.4},
URN = {urn:nbn:de:0030-drops-182748},
doi = {10.4230/LIPIcs.CCC.2023.4},
annote = {Keywords: Algebraic proof complexity, Tensor Isomorphism, Graph Isomorphism, Polynomial Calculus, Sum-of-Squares, reductions, lower bounds, proof complexity of linear algebra}
}