Polynomial multiplication over finite fields: from quadratic to straight-line complexity

DOI10.1007/s00037-006-0215-4zbMath1130.68062OpenAlexW2090959762MaRDI QIDQ862343

Michael Kaminski, Nader H. Bshouty

Publication date: 24 January 2007

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00037-006-0215-4

zbMATH Keywords

analysis of algorithmsHankel matricespolynomial multiplicationquadratic algorithmsstraight-line algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Multiplicative complexity of vector valued Boolean functions

This page was built for publication: Polynomial multiplication over finite fields: from quadratic to straight-line complexity