Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem
DOI10.1016/J.JCO.2010.05.001zbMATH Open1216.65054OpenAlexW3103289733MaRDI QIDQ990817FDOQ990817
Authors: Guillaume Chèze 
Publication date: 1 September 2010
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2010.05.001
Recommendations
complexityfactorizationrational functionspolynomial time algorithmGutieres-Rubio-Sevilla decomposition algorithmLüroth's theorem
Complexity and performance of numerical algorithms (65Y20) Symbolic computation and algebraic computation (68W30) Polynomials, factorization in commutative rings (13P05) Numerical computation of roots of polynomial equations (65H04)
Cites Work
- Improperly parametrized rational curves
- Title not available (Why is that?)
- Fast Algorithms for Manipulating Formal Power Series
- Title not available (Why is that?)
- Title not available (Why is that?)
- Equations de Pfaff algébriques
- Title not available (Why is that?)
- Reducibility of polynomials in two variables
- Irreducibility of polynomials modulo \(p\) via Newton polytopes.
- Reduzibilität ebener Kurven.
- Reducibility of rational functions in several variables
- Multivariate polynomial decomposition
- A rational function decomposition algorithm by near-separated polynomials
- Polynomial decomposition algorithms
- Reducibility of polynomials in several variables. II
- Title not available (Why is that?)
- Functional decomposition of polynomials: the tame case
- Unirational fields of transcendence degree one and functional decomposition
- Algebraic closure of a rational function
- Title not available (Why is that?)
- Lifting and recombination techniques for absolute factorization
- Improved dense multivariate polynomial factorization algorithms
- Sharp precision in Hensel lifting for bivariate polynomial factorization
- Functional decomposition of polynomials: the wild case
- On a Theorem of Lueroth
- Fast parallel absolute irreducibility testing
- Title not available (Why is that?)
- A note on a theorem of Fried and MacRae
- Polynomial decomposition algorithms
- Translates of Polynomials
- The number of reducible hypersurfaces in a pencil. -- Erratum
- Recognizing simple subextensions of purely transcendental field extensions
- A matrix-based approach to properness and inversion problems for rational surfaces
- Building counterexamples to generalizations for rational functions of Ritt's decomposition theorem
Cited In (14)
- An affine representation of de Casteljau's and de Boor's rational algorithms
- On multivariate rational function decomposition
- On the decomposition of rational functions
- Lüroth's theorem in differential fields
- Effective differential Lüroth's theorem
- Bounding the number of remarkable values via Jouanolou's theorem
- A recombination algorithm for the decomposition of multivariate rational functions
- An algorithmic approach to the \(q\)-summability problem of bivariate rational functions
- Unirational fields of transcendence degree one and functional decomposition
- An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography
- Decomposing tropical rational functions
- A note on separated factors of separated polynomials
- Practical algorithms for multivariate rational approximation
- On composite rational functions
This page was built for publication: Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990817)
