Primality testing with fewer random bits (Q1321031): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Realistic analysis of some randomized algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Factoring polynomials using fewer random bits / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5772619 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Randomized algorithms and pseudorandom numbers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3216750 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Riemann's hypothesis and tests for primality / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Probabilistic algorithm for testing primality / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Fast Monte-Carlo Test for Primality / rank | |||
Normal rank |
Revision as of 15:27, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Primality testing with fewer random bits |
scientific article |
Statements
Primality testing with fewer random bits (English)
0 references
8 May 1994
0 references
randomized algorithms
0 references
derandomization
0 references
primality testing algorithms
0 references
error probabilities
0 references
Miller-Rabin test
0 references
Solovay-Strassen test
0 references