Randomization of approximate bilinear computation for matrix multiplicationOpen Website

Osman Asif Malik, Stephen Becker

2021 (modified: 30 Sept 2021)Int. J. Comput. Math. Comput. Syst. Theory 2021Readers: Everyone
Abstract: We present a method for randomizing formulas for bilinear computation of matrix products which does not increase the leading order complexity of the computation. We consider the implications of suc...
0 Replies

OpenReview is a long-term project to advance science through improved peer review with legal nonprofit status. We gratefully acknowledge the support of the OpenReview Sponsors. © 2025 OpenReview