Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (Q429752): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Maple / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00200-011-0144-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2050415272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4755237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Magma algebra system. I: The user language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5301646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Manipulating Formal Power Series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3715247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fast multiplication of polynomials over arbitrary algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5810622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3776501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On expansion of algebraic functions in power and Puiseux series. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On expansion of algebraic functions in power and Puiseux series. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Puiseux's théorem revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calcul pratique des coefficients de Taylor d'une fonction algébrique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear differential operators for polynomial equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3476962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5531597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of computation of embedded resolution of algebraic curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: All Algebraic Functions Can Be Computed Fast / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast separable factorization and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5301681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4359470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Good reduction of Puiseux series and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular composition modulo triangular sets and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226968 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hensel construction of F(x, u <sub>1</sub> , ..., x <sub>l</sub> ) l ≥ 2 at a singular point and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast multiplication of large numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast construction of irreducible polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of the Resolution of Plane Curve Singularities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast evaluation of holonomic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective analytic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for computing an integral basis in an algebraic function field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials over finite fields: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4183410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of rational Puiseux expansions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3963124 / rank
 
Normal rank

Latest revision as of 08:42, 5 July 2024

scientific article
Language Label Description Also known as
English
Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
scientific article

    Statements

    Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (English)
    0 references
    0 references
    0 references
    20 June 2012
    0 references
    Puiseux series
    0 references
    complexity
    0 references
    algebraic functions
    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
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references