Polynomial evaluation over finite fields: new algorithms and complexity bounds
- 16 December 2011
- journal article
- research article
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 23 (3-4) , 129-141
Abstract
No abstract availableKeywords
All Related Versions
This publication has 5 references indexed in Scilit:
- On computing the syndrome polynomial in Reed–Solomon decoderEuropean Transactions on Telecommunications, 2004
- On the inherent space complexity of fast parallel multipliers for GF(2/sup m/)IEEE Transactions on Computers, 2002
- Semi-Fast Fourier Transforms over GF(2m).IEEE Transactions on Computers, 1978
- On the Number of Nonscalar Multiplications Necessary to Evaluate PolynomialsSIAM Journal on Computing, 1973
- ON THE NUMBER OF MULTIPLICATIONS REQUIRED TO COMPUTE CERTAIN FUNCTIONSProceedings of the National Academy of Sciences, 1967