Abstract
We describe a unified framework to search for optimal formulae evaluating bilinear or quadratic maps. This framework applies to polynomial multiplication and squaring, finite field arithmetic, matrix multiplication, etc. We then propose a new algorithm to solve problems in this unified framework. With an implementation of this algorithm, we prove the optimality of various published upper bounds, and find improved upper bounds. © 2012 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Barbulescu, R., Detrey, J., Estibals, N., & Zimmermann, P. (2012). Finding optimal formulae for bilinear maps. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7369 LNCS, pp. 168–186). https://doi.org/10.1007/978-3-642-31662-3_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
