Loading…
Constructive non-commutative rank computation is in deterministic polynomial time
Ivanyos, Gábor, Qiao, Youming, Subrahmanyam, K. V.
Published in Computational complexity (01.12.2018)
Published in Computational complexity (01.12.2018)
Get full text
Journal Article
Loading…
Loading…
Non-commutative Edmonds’ problem and matrix semi-invariants
Ivanyos, Gábor, Qiao, Youming, Subrahmanyam, K. V.
Published in Computational complexity (01.09.2017)
Published in Computational complexity (01.09.2017)
Get full text
Journal Article
Loading…
On vanishing of Kronecker coefficients
Ikenmeyer, Christian, Mulmuley, Ketan D., Walter, Michael
Published in Computational complexity (01.12.2017)
Published in Computational complexity (01.12.2017)
Get full text
Journal Article
Loading…
Loading…
Loading…
Loading…
Loading…
Loading…
Loading…
Loading…
Barriers for rectangular matrix multiplication
Christandl, Matthias, Gall, François Le, Lysikov, Vladimir, Zuiddam, Jeroen
Published in Computational complexity (01.06.2025)
Published in Computational complexity (01.06.2025)
Get full text
Journal Article
Loading…
Loading…
Loading…
Loading…
Determinants vs. Algebraic Branching Programs
Chatterjee, Abhranil, Kumar, Mrinal, Volk, Ben Lee
Published in Computational complexity (01.12.2024)
Published in Computational complexity (01.12.2024)
Get full text
Journal Article
Loading…
Loading…