Conference paper
Low-Resource Speech Recognition of 500-Word Vocabularies
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001
In this paper we study the bilinear complexity of multiplying two arbitrary elements from an nth degree extension Φ of a finite field F, and the related problem of multiplying, over F, two polynomials of degree n - 1 with indeterminate coefficients. We derive a new linear lower bound, and we describe an algorithm leading to a quasi-linear upper bound. © 1983.
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001
Bowen Zhou, Bing Xiang, et al.
SSST 2008
Anupam Gupta, Viswanath Nagarajan, et al.
Operations Research
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev