Koszul-Young flattenings and symmetric border rank of the determinant

JOURNAL OF ALGEBRA

卷:447

Article

关键词: Computational complexity;    Determinant;    Permanent;   

DOI  :  10.1016/j.jalgebra.2015.11.011

来源: Elsevier

【 摘 要 】

We present new lower bounds for the symmetric border rank of the n x n determinant for all n. Further lower bounds are given for the 3 x 3 permanent. (C) 2015 Elsevier Inc. All rights reserved.

【 授权许可】

Free