Topics in computational algebraic number theory (Q558179): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An efficient algorithm for the computation of Galois automorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factor Refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relative van Hoeij algorithm over number fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generators and relations for \(K_{2}O_{F}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring into coprimes in essentially linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating rings of integers in number fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On factor refinement in number fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advanced Topics in Computional Number Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial reduction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential algorithms for class group and unit computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Hilbert class field of real quadratic fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: KANT V4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizations of the subresultant algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implementation of the Number Field Sieve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing class fields via the Artin map / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2739450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for polynomial factorization over \(\mathbb Q_p\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Rigorous Subexponential Algorithm For Computation of Class Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing subfields. A detailed description of the algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3935355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787201 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840158 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient isolation of polynomial's real roots. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice basis reduction: Improved practical algorithms and solving subset sum problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248250 / rank
 
Normal rank

Latest revision as of 13:13, 10 June 2024

scientific article
Language Label Description Also known as
English
Topics in computational algebraic number theory
scientific article

    Statements

    Topics in computational algebraic number theory (English)
    0 references
    0 references
    0 references
    30 June 2005
    0 references
    The author gives a survey on the presently best known methods for computations in algebraic number fields. The emphasis is on arithmetic with algebraic integers and ideals with a view towards the calculation of ray class fields. Following the introduction the author discusses basic arithmetic. He compares integer and floating point representations with respect to reduction methods. He then develops special two element representations for prime ideals which are more appropriate for ray class group calculations. He concludes with discrete logarithms for such groups and ray class field computations. Analyzing known methods he is frequently capable to modify algorithms for a speed-up. The improved algorithms were implemented in the PARI/GP system.
    0 references
    0 references
    computational methods for number fields
    0 references
    survey
    0 references
    ray class group
    0 references
    discrete logarithms
    0 references
    class field
    0 references
    PARI/GP
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references