Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 206,530,882 papers from all fields of science
Search
Sign In
Create Free Account
Solovay–Strassen primality test
Known as:
Solovay-Strassen test
, Solovay-Strassen algorithm
, Solovay-Strassen primality test
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
Complexity class
Cryptography
Cryptosystem
Decision problem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Pseudoprime Numbers: Basic Concepts and the Problem of Security
V. Pevnev
ICTERI
2017
Corpus ID: 22919528
The analysis of existing methods of construction of prime numbers is carried out in the presented paper. New concepts related to…
Expand
2016
2016
Perbedaan Sekuens Asam Amino Epitop Sel B dan Sel T pada Protein Hemaglutinin (H) Antara Virus Campak Liar dan Virus Vaksin di Indonesia
M. Setiawan
,
Agus Sjahrurachman
,
R. Ibrahim
,
A. Suwandono
2016
Corpus ID: 63321544
Latar belakang. Protein H virus campak sangat penting agar virus dapat menginfeksi sel pejamu. Selain itu, protein H dapat…
Expand
2016
2016
Perbuatan Pungutan Liar (Pungli) Sebagai Tindak Pidana Korupsi (Analisis Pasal 2 Ayat (1) Dan Pasal 3 UU. RI Nomor 31 Tahun 1999 Tentang Pemberantasan Tindak Pidana Korupsi Sebagaimana Telah Diubah…
A. JuliAntoroHutapeaNim.
,
J. M. S. Untan
2016
Corpus ID: 152229746
2001) OLEH: JULI ANTORO HUTAPEA NIM. A2021141005 ABSTRAK Tindak Pidana Korupsi sebagai kejahatan luar biasa (extra ordinary crime…
Expand
2015
2015
Framework for Evaluation and Comparison of Primality Testing Algorithms
Cristina-Loredana Duta
,
L. Gheorghe
,
N. Tapus
20th International Conference on Control Systems…
2015
Corpus ID: 15206845
Nowadays, public-key cryptography is widely used to ensure data protection (privacy, integrity, authentication). Public-key…
Expand
2012
2012
Simulating chemistry efficiently on fault-tolerant quantum computers
N. C. Jones
,
J. Whitfield
,
+4 authors
Y. Yamamoto
2012
Corpus ID: 119119118
Quantum computers can in principle simulate quantum physics exponentially faster than their classical counterparts, but some…
Expand
2005
2005
Solovay Reducibility on D-c.e Real Numbers
Robert Rettinger
,
Xizhong Zheng
COCOON
2005
Corpus ID: 18962518
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
2001
Highly Cited
2001
Randomness and reducibility
R. Downey
,
Denis R. Hirschfeldt
,
G. LaForte
J. Comput. Syst. Sci.
2001
Corpus ID: 13564392
Highly Cited
1994
Highly Cited
1994
RELATIVIZABLE AND NONRELATIVIZABLE THEOREMS IN THE POLYNOMIAL THEORY OF ALGORITHMS
N. Vereshchagin
1994
Corpus ID: 17469006
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
Petri Nets and Large Finite Sets
K. McAloon
Theor. Comput. Sci.
1984
Corpus ID: 37496417
Highly Cited
1971
Highly Cited
1971
Elementary embeddings and infinitary combinatorics
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…
Expand
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)
ACCEPT & CONTINUE