An Almost Optimal Rank Bound for Depth-3 Identities

Nitin Saxena, C. Seshadhri. An Almost Optimal Rank Bound for Depth-3 Identities. Electronic Colloquium on Computational Complexity (ECCC), 15(108), 2008. [doi]

Abstract

Abstract is missing.