Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem
From MaRDI portal
(Redirected from Publication:990817)
Recommendations
Cites work
- scientific article; zbMATH DE number 4128945 (Why is no real title available?)
- scientific article; zbMATH DE number 4047850 (Why is no real title available?)
- scientific article; zbMATH DE number 3785004 (Why is no real title available?)
- scientific article; zbMATH DE number 1273634 (Why is no real title available?)
- scientific article; zbMATH DE number 691245 (Why is no real title available?)
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- scientific article; zbMATH DE number 1467743 (Why is no real title available?)
- A matrix-based approach to properness and inversion problems for rational surfaces
- A note on a theorem of Fried and MacRae
- A rational function decomposition algorithm by near-separated polynomials
- Algebraic closure of a rational function
- Building counterexamples to generalizations for rational functions of Ritt's decomposition theorem
- Equations de Pfaff algébriques
- Fast Algorithms for Manipulating Formal Power Series
- Fast parallel absolute irreducibility testing
- Functional decomposition of polynomials: the tame case
- Functional decomposition of polynomials: the wild case
- Improperly parametrized rational curves
- Improved dense multivariate polynomial factorization algorithms
- Irreducibility of polynomials modulo \(p\) via Newton polytopes.
- Lifting and recombination techniques for absolute factorization
- Multivariate polynomial decomposition
- On a Theorem of Lueroth
- Polynomial decomposition algorithms
- Polynomial decomposition algorithms
- Recognizing simple subextensions of purely transcendental field extensions
- Reducibility of polynomials in several variables. II
- Reducibility of polynomials in two variables
- Reducibility of rational functions in several variables
- Reduzibilität ebener Kurven.
- Sharp precision in Hensel lifting for bivariate polynomial factorization
- The number of reducible hypersurfaces in a pencil. -- Erratum
- Translates of Polynomials
- Unirational fields of transcendence degree one and functional decomposition
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
- Effective differential Lüroth's theorem
- Lüroth's theorem in differential fields
- 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)
