Skip to search formSkip to main contentSkip to account menu

Schönhage–Strassen algorithm

Known as: Schönhage Strassen algorithm, Schoenhage Strassen, Schonhage-Strassen algorithm 
The Schönhage–Strassen algorithm is an asymptotically fast multiplication algorithm for large integers. It was developed by Arnold Schönhage and… 
Wikipedia (opens in a new tab)

Related topics

Related topics

29 relations
Arbitrary-precision arithmeticBinary GCD algorithmBinary splittingCLN, a Class Library for Numbers

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Design of a Flexible Schönhage-Strassen FFT Polynomial Multiplier with High- Level Synthesis to Accelerate HE in the Cloud
Homomorphic Encryption (HE) allows for encrypted data to be sent to, stored, and operated on by untrusted parties without the… 
2019
2019
Modification and Optimization of Solovey-Strassen's Fast Exponentiation Probablistic Test Binary Algorithm
This article will consider the probability test of Solovey-Strassen, to determine the simplicity of the number and its possible… 
2010
2010
High precision integer multiplication with a graphics processing unit
In this paper we evaluate the potential for using an NVIDIA graphics processing unit (GPU) to accelerate high precision integer… 
2005
2005
A Complete Characterization of the Algebras of Minimal Bilinear Complexity
  • M. Bläser
  • SIAM journal on computing (Print)
  • 2005
  • Corpus ID: 29355467
Let R(A) denote the rank (also called bilinear complexity) of a finite dimensional associative algebra A. A fundamental lower… 
2005
2005
Entwicklung eines aktiven Scheinwerfersystems zur blendungsfreien Ausleuchtung des Verkehrsraums
Bei naechtlichen Verkehrsunfaellen spielt haeufig das spaete Erkennen von Objekten im Verkehrsraum eine Rolle. Aufgabe der Kfz… 
2004
2004
The Accelerated Euclidean Algorithm
The algorithm is based on a half-gcd like procedure, but unlike Schonhage’s algorithm, it is iterative and therefore avoids the… 
2000
2000
Lower bounds for the bilinear complexity of associative algebras
Abstract. Let R(A) denote the bilinear complexity (also called rank) of a finite dimensional associative algebra A.¶We prove that… 
1996
1996
MYTHOS REICHSAUTOBAHN - BAU UND INSZENIERUNG DER "STRASSEN DES FUEHRERS" 1933-1941
Das Buch beinhaltet eine kritisch gehaltene Schilderung des Baues der Autobahnen vor und waehrend des Krieges, gestuetzt auf eine… 
1993
1993
Primality testing with fewer random bits
In the usual formulations of the Miller-Rabin and Solovay-Strassen primality testing algorithms for a numbern, the algorithm… 
1991
1991
Statistical complexity of dominant eigenvector calculation
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)