5/2n2-lower bound for the rank of n × n-matrix multiplication over arbitrary fields

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1999, Pages 45-50

  Blaeser, Markus ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; CONFORMAL MAPPING; MATRIX ALGEBRA; VECTORS;

ARBITRARY FIELDS; MATRIX MULTIPLICATION;

THEOREM PROVING;

EID: 0033325491     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)