Solovay–Strassen primality test

Known as: Solovay-Strassen test, Solovay-Strassen algorithm, Solovay-Strassen primality test 
The Solovay–Strassen primality test, developed by Robert M. Solovay and Volker Strassen, is a probabilistic test to determine if a number is… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1979-2017
01219792017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
The main contribution of this paper is a the analysis of HOD below the theory AD+ + “The largest Suslin cardinal is a member of… (More)
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Many number-theoretic algorithms rely on a result of Ankeny, which states that if the Extended Riemann Hypothesis (ERH) is true… (More)
  • table 2
  • table 3
Is this relevant?
2008
2008
In quantum computation we are given a finite set of gates and we have to perform a desired operation as a product of them. The… (More)
Is this relevant?
2007
2007
Working with Hardy hierarchy and the notion of largeness determined by it, we define the notion of a partition of a finite set of… (More)
Is this relevant?
2007
2007
In the usual formulations of the Miller-Rabin and Solovay-Strassen primality testing algorithms, to test a number n for primality… (More)
Is this relevant?
2006
2006
Following the work by Kitaev, Freedman and Wang [1], Aharonov, Jones and Landau [3] recently gave an explicit and efficient… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1993
1993
In the usual formulations of the Miller-Rabin and Solovay-Strassen primality testing algorithms for a numbern, the algorithm… (More)
Is this relevant?
Highly Cited
1986
Highly Cited
1986
This paper presents a new probabilistie primality test. Upon termination the test outputs "composite" or "prime", along with a… (More)
Is this relevant?
Highly Cited
1980
Highly Cited
1980
A new algorithm for testing primality is presented. The algorithm is distinguishable from the lovely algorithms of Solvay and… (More)
Is this relevant?
Highly Cited
1979
Highly Cited
1979
In 1870 Bouniakowsky [2 J publ ished an algorithm to solve the congruence aX _ bMOD (q). While his algorithm contained several… (More)
Is this relevant?