Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields
DOI10.1145/1390768.1390802zbMATH Open1489.13043OpenAlexW2019223056MaRDI QIDQ5301629FDOQ5301629
Authors: Adrien Poteaux, Marc Rybowicz 
Publication date: 20 January 2009
Published in: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1390768.1390802
Recommendations
- Improving complexity bounds for the computation of Puiseux series over finite fields
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
- On the complexity of matrix reduction over finite fields
- Good reduction of Puiseux series and applications
- scientific article; zbMATH DE number 177888
- Efficient \(p\)th root computations in finite fields of characteristic \(p\)
- Fast Computation of the Nth Term of an Algebraic Series over a Finite Prime Field
- Polynomial evaluation over finite fields: new algorithms and complexity bounds
- New Algorithms for Finding Irreducible Polynomials Over Finite Fields
- scientific article; zbMATH DE number 1522539
Symbolic computation and algebraic computation (68W30) Plane and space curves (14H50) Polynomials, factorization in commutative rings (13P05) Computational aspects of algebraic curves (14Q05)
Cited In (7)
- Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients
- Curves testing boundedness of polynomials on subsets of the real plane
- Good reduction of Puiseux series and applications
- Improving complexity bounds for the computation of Puiseux series over finite fields
- A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function
- Title not available (Why is that?)
- Computing Puiseux series: a fast divide and conquer algorithm
This page was built for publication: Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301629)
