Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth Theorem

[1]  Paul Gordan.  ueber biquadratische Gleichungen , 1887 .

[2]  J. Ritt,et al.  Prime and composite polynomials , 1922 .

[3]  Jun-ichi Igusa,et al.  On a Theorem of Lueroth , 1951 .

[4]  B. F. Caviness,et al.  Proceedings of the fourth ACM symposium on Symbolic and algebraic computation , 1976 .

[5]  Barry M. Trager,et al.  Algebraic factoring and rational function integration , 1976, SYMSAC '76.

[6]  H. T. Kung,et al.  Fast Algorithms for Manipulating Formal Power Series , 1978, JACM.

[7]  W. J. Thron,et al.  Encyclopedia of Mathematics and its Applications. , 1982 .

[8]  Andrzej Schinzel.  Reducibility of polynomials in several variables. II. , 1985 .

[9]  Erich Kaltofen,et al.  Fast Parallel Absolute Irreducibility Testing , 1985, J. Symb. Comput..

[10]  Vangalur S. Alagar,et al.  Fast Polynominal Decomposition Algorithms , 1985, European Conference on Computer Algebra.

[11]  Richard Zippel,et al.  Polynomial Decomposition Algorithms , 1985, J. Symb. Comput..

[12]  Thomas W. Sederberg,et al.  Improperly parametrized rational curves , 1986, Comput. Aided Geom. Des..

[13]  Wolfgang Ruppert,et al.  Reduzibilität ebener Kurven. , 1986 .

[14]  Roberto Dvornicich,et al.  Newton Symmetric Functions and the Arithmetic of Algebraically Closed Fields , 1987, AAECC.

[15]  Matthew T. Dickerson,et al.  Polynomial Decomposition Algorithms For Multivariate Polynomials , 1987 .

[16]  Susan Landau,et al.  Polynomial Decomposition Algorithms , 1989, J. Symb. Comput..

[17]  Joachim von zur Gathen,et al.  Functional Decomposition of Polynomials: The Tame Case , 1990, J. Symb. Comput..

[18]  Joachim von zur Gathen,et al.  Functional Decomposition of Polynomials: The Wild Case , 1990, J. Symb. Comput..

[19]  Richard Zippel,et al.  Rational function decomposition , 1991, ISSAC '91.

[20]  Angelo Vistoli,et al.  The number of reducible hypersurfaces in a pencil , 1993 .

[21]  Dino Lorenzini,et al.  Reducibility of Polynomials in Two Variables , 1993 .

[22]  V. Pan,et al.  Polynomial and Matrix Computations , 1994, Progress in Theoretical Computer Science.

[23]  Tomás Recio,et al.  A Rational Function Decomposition Algorithm by Near-Separated Polynomials , 1995, J. Symb. Comput..

[24]  Josef Schicho.  A note on a theorem of Fried and MacRae , 1995 .

[25]  A. Storjohann.  Algorithms for matrix canonical forms , 2000 .

[26]  Andrzej Schinzel,et al.  Polynomials with Special Regard to Reducibility , 2000 .

[27]  Jörn Müller-Quade,et al.  Recognizing Simple Subextensions of Purely Transcendental Field Extensions , 2000, Applicable Algebra in Engineering, Communication and Computing.

[28]  David Sevilla,et al.  Unirational fields of transcendence degree one and functional decomposition , 2001, ISSAC '01.

[29]  R. Gregory Taylor,et al.  Modern computer algebra , 2002, SIGA.

[30]  Shuhong Gao,et al.  Irreducibility of polynomials modulo p via Newton polytopes , 2003 .

[31]  Shreeram S. Abhyankar,et al.  Translates of Polynomials , 2015, 1508.07385.

[32]  Joachim von zur Gathen,et al.  Multivariate Polynomial Decomposition , 2003, Applicable Algebra in Engineering, Communication and Computing.

[33]  Jean Moulin Ollagnier,et al.  Algebraic closure of a rational function , 2004 .

[34]  Arnaud Bodin.  Reducibility of rational functions in several variables , 2005 .

[35]  Laurent Busé,et al.  A matrix-based approach to properness and inversion problems for rational surfaces , 2006, Applicable Algebra in Engineering, Communication and Computing.

[36]  Grégoire Lecerf,et al.  Sharp precision in Hensel lifting for bivariate polynomial factorization , 2006, Math. Comput..

[37]  Grégoire Lecerf,et al.  Improved dense multivariate polynomial factorization algorithms , 2007, J. Symb. Comput..

[38]  Grégoire Lecerf,et al.  Lifting and recombination techniques for absolute factorization , 2007, J. Complex..

[39]  David Sevilla,et al.  Building counterexamples to generalizations for rational functions of Ritt's decomposition theorem , 2006, ArXiv.

[40]  Laurent Busé,et al.  On the total order of reducibility of a pencil of algebraic plane curves , 2008, ArXiv.