Fast verification, testing, and generation of large primes (Q1132906): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the computational power of pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Factorizations of 2 n ± 1 and Related Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5831393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On factorisation, with a suggested new approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lattice Point Covering Theorem for Rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Prime Has a Succinct Certificate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4164569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Monte-Carlo Test for Primality / rank
 
Normal rank

Latest revision as of 02:37, 13 June 2024

scientific article
Language Label Description Also known as
English
Fast verification, testing, and generation of large primes
scientific article

    Statements

    Fast verification, testing, and generation of large primes (English)
    0 references
    1979
    0 references
    generation
    0 references
    large primes
    0 references
    stochastic method
    0 references
    prime testing method
    0 references

    Identifiers