On the algebraic proof complexity of tensor isomorphism

DOI10.4230/LIPICS.CCC.2023.4MaRDI QIDQ6640337zbMATH OpenFDO

Authors Nicola Galesi, Joshua A. Grochow, Toniann Pitassi, Adrian She

Publication date 19 November 2024

zbMATH Keywords

lower boundsgraph isomorphismreductionssum-of-squarespolynomial calculustensor isomorphismalgebraic proof complexityproof complexity of linear algebra

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: On the algebraic proof complexity of tensor isomorphism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6640337)