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.
2009
2009
We introduce the concept of quantum tensor product expanders. These generalize theconcept of quantum expanders, which are quantum… Expand
Is this relevant?
2007
2007
Abstract The large cardinal axioms of the title assert, respectively, the existence of a nontrivial elementary embedding j : V… Expand
Is this relevant?
2007
2007
A method for compiling quantum algorithms into specific braiding patterns for non-Abelian quasiparticles described by the so… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
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
Is this relevant?
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
Is this relevant?
2004
2004
Solovay [R.M. Solovay, On random R.E. sets, in: A.I. Arruda, N.C.A. da Costa, R. Chaqui (Eds.), Non-Classical Logics, Model… Expand
Is this relevant?
2004
2004
We study reducibilities that act as measures of relative randomness on reals, concentrating particularly on their behavior on the… Expand
Is this relevant?
1994
1994
Starting with the paper of Baker, Gill, and Solovay [BGS 75] in complexity theory, many results have been proved that separate… Expand
Is this relevant?
1984
1984
An upper bound is given for the complexity of the Karp-Miller decision procedure for the Finite Containment Problem for pairs of… Expand
Is this relevant?
Highly Cited
1971
Highly Cited
1971
One of the standard ways of postulating large cardinal axioms is to consider elementary embeddings, j , from the universe, V… Expand
Is this relevant?