Jeroen Zuiddam

Fulvio Gesmundo

SIAM J. Appl. Algebra Geom., December, 2023

The next gap in the subrank of 3-tensors.

[BibT_eX]

[DOI]

Fulvio Gesmundo

CoRR, 2023

Discreteness of asymptotic tensor ranks.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Larger Corner-Free Sets from Combinatorial Degenerations.

[BibT_eX]

[DOI]

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Subrank and Optimal Reduction of Scalar Multiplications to Generic Tensors.

[BibT_eX]

[DOI]

Harm Derksen

Visu Makam

Proceedings of the 37th Computational Complexity Conference, 2022

2021

Barriers for Fast Matrix Multiplication from Irreversibility.

[BibT_eX]

[DOI]

Theory Comput., 2021

Quantum Asymptotic Spectra of Graphs and Non-Commutative Graphs, and Quantum Shannon Capacities.

[BibT_eX]

[DOI]

Yinan Li

IEEE Trans. Inf. Theory, 2021

Border Rank Nonadditivity for Higher Order Tensors.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2021

Amortized Circuit Complexity, Formal Complexity Measures, and Catalytic Algorithms.

[BibT_eX]

[DOI]

Robert Robere

Electron. Colloquium Comput. Complex., 2021

Communication Complexity, Corner-Free Sets and the Symmetric Subrank of Tensors.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Geometric Rank of Tensors and Subrank of Matrix Multiplication.

[BibT_eX]

[DOI]

Swastik Kopparty

Guy Moshkovitz

Electron. Colloquium Comput. Complex., 2020

Barriers for Rectangular Matrix Multiplication.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2020

Weighted Slice Rank and a Minimax Correspondence to Strassen's Spectra.

[BibT_eX]

[DOI]

Vladimir Lysikov

CoRR, 2020

Border rank non-additivity for higher order tensors.

[BibT_eX]

[DOI]

CoRR, 2020

The Asymptotic Induced Matching Number of Hypergraphs: Balanced Binary Strings.

[BibT_eX]

[DOI]

Srinivasan Arunachalam

Electron. J. Comb., 2020

2019

The Asymptotic Spectrum of Graphs and the Shannon Capacity.

[BibT_eX]

[DOI]

Comb., 2019

Tensor surgery and tensor rank.

[BibT_eX]

[DOI]

Comput. Complex., 2019

Asymptotic tensor rank of graph tensors: beyond matrix multiplication.

[BibT_eX]

[DOI]

Comput. Complex., 2019

2018

On Algebraic Branching Programs of Small Width.

[BibT_eX]

[DOI]

Karl Bringmann

Christian Ikenmeyer

J. ACM, 2018

The border support rank of two-by-two matrix multiplication is seven.

[BibT_eX]

[DOI]

Markus Bläser

Chic. J. Theor. Comput. Sci., 2018

Universal points in the asymptotic spectrum of tensors.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017

Orthogonal rank and impossibility of quantum round elimination.

[BibT_eX]

[DOI]

Jop Briët

Quantum Inf. Comput., 2017

Tensor rank is not multiplicative under the tensor product.

[BibT_eX]

[DOI]

Asger Kjærulff Jensen

CoRR, 2017

Nondeterministic Quantum Communication Complexity: the Cyclic Equality Game and Iterated Matrix Multiplication.

[BibT_eX]

[DOI]

Harry Buhrman

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016

On the orthogonal rank of Cayley graphs and impossibility of quantum round elimination.

[BibT_eX]

[DOI]

Jop Briët

CoRR, 2016

2015

A note on the gap between rank and border rank.

[BibT_eX]

[DOI]