• DOI:10.1109/SFCS.1978.34
Corpus ID: 14348408

Strassen's algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations

@article{Pan1978StrassensAI,
  title={Strassen's algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations},
  author={V. Pan},
  journal={19th Annual Symposium on Foundations of Computer Science (sfcs 1978)},
  year={1978},
  pages={166-176}
}

V. Pan

Published 1978

Mathematics, Computer Science

19th Annual Symposium on Foundations of Computer Science (sfcs 1978)

View on IEEE

doi.ieeecomputersociety.org

Save to Library

Create Alert

Cite

Launch Research Feed

A new technique of trilinear operations of aggregating, uniting and canceling is introduced and applied to constructing fast linear non-commutative algorithms for matrix multiplication. The result is an asymptotic improvement of Strassen's famous algorithms for matrix operations.