On the algebraic proof complexity of tensor isomorphism

From MaRDI portal

Revision as of 19:37, 13 February 2025 by Import250213030230 (talk | contribs) (Created automatically from import250213030230)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:6640337

Jump to:navigation, search

DOI10.4230/LIPICS.CCC.2023.4MaRDI QIDQ6640337FDOQ6640337

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

Publication date: 19 November 2024

zbMATH Keywords

lower bounds graph isomorphism reductions sum-of-squares polynomial calculus tensor isomorphism algebraic proof complexity proof 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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6640337&oldid=40209698"