Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

On the reduction in multiplicative complexity achieved by the polynomial residue number system

From MaRDI portal
Publication:4031499
Jump to:navigation, search

DOI10.1109/78.157231zbMath0774.65010OpenAlexW2118935186MaRDI QIDQ4031499

Glenn S. Zelniker, Fred J. Taylor

Publication date: 1 April 1993

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/78.157231


zbMATH Keywords

finite fieldcomplexity reductionassociative algebraspolynomial multiplicationpolynomial residue number system


Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Complexity and performance of numerical algorithms (65Y20)








This page was built for publication: On the reduction in multiplicative complexity achieved by the polynomial residue number system

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4031499&oldid=17748727"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 02:47.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki