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

Implementation of the DKSS Algorithm for Multiplication of Large Numbers

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

DOI10.1145/2755996.2756643zbMath1346.68294OpenAlexW1981424768MaRDI QIDQ2819767

Christoph Lüders

Publication date: 29 September 2016

Published in: Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2755996.2756643


zbMATH Keywords

fast Fourier transforminteger multiplicationmultiprecision arithmetic


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Numerical methods for discrete and fast Fourier transforms (65T50)


Related Items (2)

Lattice-based zero-knowledge arguments for additive and multiplicative relations ⋮ Faster integer multiplication using short lattice vectors






This page was built for publication: Implementation of the DKSS Algorithm for Multiplication of Large Numbers

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