Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The analysis of existing methods of construction of prime numbers is carried out in the presented paper. New concepts related to… 
2016
2016
Latar belakang. Protein H virus campak sangat penting agar virus dapat menginfeksi sel pejamu. Selain itu, protein H dapat… 
2016
2016
2001) OLEH: JULI ANTORO HUTAPEA NIM. A2021141005 ABSTRAK Tindak Pidana Korupsi sebagai kejahatan luar biasa (extra ordinary crime… 
2015
2015
Nowadays, public-key cryptography is widely used to ensure data protection (privacy, integrity, authentication). Public-key… 
2012
2012
Quantum computers can in principle simulate quantum physics exponentially faster than their classical counterparts, but some… 
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… 
Highly Cited
2001
Highly Cited
2001
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… 
Highly Cited
1984
Highly Cited
1984
  • K. McAloon
  • Theor. Comput. Sci.
  • 1984
  • Corpus ID: 37496417
Highly Cited
1971
Highly Cited
1971
  • K. Kunen
  • Journal of Symbolic Logic
  • 1971
  • Corpus ID: 38948969
One of the standard ways of postulating large cardinal axioms is to consider elementary embeddings, j, from the universe, V, into…