Detecting perfect powers in essentially linear time (Q4396462): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: DBLP publication ID (P1635): journals/moc/Bernstein98, #quickstatements; #temporary_batch_1731468600454
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q29302811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sieve algorithms for perfect power testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Multiple-Precision Evaluation of Elementary Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of Oppenheim concerning ''Factorisatio Numerorum'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3935355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The development of the number field sieve / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hyperelliptic smoothness test. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some problems involving powers of integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicative dependence in number fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3739243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3827224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast polynomial transform algorithms for digital convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324957 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3713481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast compact prime number sieves (among others) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate formulas for some functions of prime numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast multiplication of large numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5670687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3290778 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/moc/Bernstein98 / rank
 
Normal rank

Latest revision as of 05:14, 13 November 2024

scientific article; zbMATH DE number 1165754
Language Label Description Also known as
English
Detecting perfect powers in essentially linear time
scientific article; zbMATH DE number 1165754

    Statements

    Detecting perfect powers in essentially linear time (English)
    0 references
    14 June 1998
    0 references
    perfect powers
    0 references
    fast multiplication
    0 references
    Newton's method
    0 references
    linear forms in logarithms
    0 references
    transcendental number theory
    0 references
    number theoretic algorithms
    0 references

    Identifiers