Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Let $G$ be either the Grigorchuk $2$-group or one of the Gupta-Sidki $p$-groups. We give new upper bounds for the diameters of… Expand
2017
2017
The analysis of existing methods of construction of prime numbers is carried out in the presented paper. New concepts related to… Expand
  • table 1
2012
2012
Quantum computers can in principle simulate quantum physics exponentially faster than their classical counterparts, but some… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • table 1
2005
2005
A c.e. real x is Solovay reducible to another c.e. real y if x can be approximated at least as efficiently as y by means of… Expand
Highly Cited
2005
Highly Cited
2005
A notion of log space Turing reducibility is introduced. It is used to define relative notions of log space,ℒA, and… Expand
Highly Cited
2004
Highly Cited
2004
We study reducibilities that act as measures of relative randomness on reals, concentrating particularly on their behavior on the… Expand
2001
2001
How random is a real? Given two reals, which is more random? If we partition reals into equivalence classes of reals of the “same… Expand
Highly Cited
1994
Highly Cited
1994
Starting with the paper of Baker, Gill, and Solovay [BGS 75] in complexity theory, many results have been proved that separate… Expand
Highly Cited
1984
Highly Cited
1984
  • K. McAloon
  • Theor. Comput. Sci.
  • 1984
  • Corpus ID: 37496417
An upper bound is given for the complexity of the Karp-Miller decision procedure for the Finite Containment Problem for pairs of… Expand
Highly Cited
1971
Highly Cited
1971
  • K. Kunen
  • J. Symb. Log.
  • 1971
  • Corpus ID: 38948969
One of the standard ways of postulating large cardinal axioms is to consider elementary embeddings, j , from the universe, V… Expand