Fast Computation With Two Algebraic Numbers

We propose fast algorithms for computing composed multiplications and composed sums, as well as «diamond products» of univariate polynomials.

[1]  Fabrice Rouillier,et al.  Solving Zero-Dimensional Systems Through the Rational Univariate Representation , 1999, Applicable Algebra in Engineering, Communication and Computing.

[2]  Bruno Buchberger,et al.  Newton Identities in the Multivariate Case: Pham Systems , 1998 .

[3]  Henry C. Thacher,et al.  Applied and Computational Complex Analysis. , 1988 .

[4]  S. A. Abramov,et al.  Rational solutions of linear differential and difference equations with polynomial coefficients , 1991 .

[5]  Marko Petkovsek,et al.  Hypergeometric Solutions of Linear Recurrences with Polynomial Coefficents , 1992, J. Symb. Comput..

[6]  Marc Giusti,et al.  Algebraic Transformations of Polynomial Equations, Symmetric Polynomials and Elimination , 1988, ISSAC.

[7]  Joachim von zur Gathen,et al.  Fast algorithms for Taylor shifts and certain difference equations , 1997, ISSAC.

[8]  M. V. Hoeij.  Factoring Polynomials and the Knapsack Problem , 2002 .

[9]  Kazuhiro Yokoyama,et al.  Finding roots of unity among quotients of the roots of an integral polynomial , 1995, ISSAC '95.

[10]  Victor Shoup.  Efficient computation of minimal polynomials in algebraic extensions of finite fields , 1999, ISSAC '99.

[11]  V. Strassen.  Gaussian elimination is not optimal , 1969 .

[12]  J. A. L. Thiong.  Note for computing the minimum polynomial of elements in large finite fields , 1989 .

[13]  John McKay,et al.  Symmetric functions, m -sets, and Galois groups , 1994 .

[14]  L. Kronecker.  Grundzüge einer arithmetischen Theorie der algebraischen Grössen. (Abdruck einer Festschrift zu Herrn E. E. Kummers Doctor-Jubiläum, 10. September 1881.). , 2022 .

[15]  Alain Lascoux,et al.  La resultante de deux polynomes , 1986 .

[16]  Larry J. Stockmeyer,et al.  On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials , 1973, SIAM J. Comput..

[17]  Éric Schost,et al.  Fast Algorithms for Zero-Dimensional Polynomial Systems using Duality , 2003, Applicable Algebra in Engineering, Communication and Computing.

[18]  Victor Shoup,et al.  Fast construction of irreducible polynomials over finite fields , 1994, SODA '93.

[19]  Laureano González-Vega,et al.  Using Symmetric Functions to Describe the Solution Set of a Zero Dimensional Ideal , 1995, AAECC.

[20]  Victor Shoup,et al.  A New Polynomial Factorization Algorithm and its Implementation , 1995, J. Symb. Comput..

[21]  S. Abramov.  On the summation of rational functions , 1971 .

[22]  Yiu-Kwong Man,et al.  Fast polynomial dispersion computation and its application to indefinite summation , 1994, ISSAC '94.

[23]  J. Berstel,et al.  Deux propriétés décidables des suites récurrentes linéaires , 1976 .

[24]  David A. Cox,et al.  Using Algebraic Geometry , 1998 .

[25]  Joan Borrell,et al.  Improving the Time Complexity of the Computation of Irreducible and Primitive Polynomials in Finite Fields , 1991, AAECC.

[26]  Thomas Lickteig,et al.  Sylvester-Habicht Sequences and Fast Cauchy Index Computation , 2001, J. Symb. Comput..

[27]  Emmanuel Briand,et al.  MULTIVARIATE NEWTON SUMS: IDENTITIES AND GENERATING FUNCTIONS , 2002 .

[28]  Shuhong Gao,et al.  Computing Composed Products of Polynomials , 1999 .

[29]  Joachim von zur Gathen,et al.  Modern Computer Algebra , 1998 .

[30]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[31]  Victor Y. Pan,et al.  Faster solution of the key equation for decoding BCH error-correcting codes , 1997, STOC '97.

[32]  Annick Valibouze.  Fonctions symétriques et changements de bases , 1987, EUROCAL.

[33]  Victor Y. Pan,et al.  Parallel Computation of Polynomial GCD and Some Related Parallel Computations over Abstract Fields , 1996, Theor. Comput. Sci..

[34]  Victor Y. Pan,et al.  Fast Rectangular Matrix Multiplication and Applications , 1998, J. Complex..

[35]  Volker Strassen,et al.  Algebraic Complexity Theory , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[36]  John J. Cannon,et al.  The Magma Algebra System I: The User Language , 1997, J. Symb. Comput..

[37]  Philippe Flajolet,et al.  Basic analytic combinatorics of directed lattice paths , 2002, Theor. Comput. Sci..

[38]  Victor Shoup,et al.  New algorithms for finding irreducible polynomials over finite fields , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[39]  Thomas Lickteig,et al.  Cauchy index computation , 1996 .

[40]  R. Schoof.  Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p , 1985 .

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

[42]  Laureano González-Vega,et al.  Implicitization of parametric curves and surfaces by using symmetric functions , 1995, ISSAC '95.

[43]  Guillaume Hanrot,et al.  The Middle Product Algorithm I , 2004, Applicable Algebra in Engineering, Communication and Computing.

[44]  R. Schoof,et al.  Elliptic curves over finite fi elds and the computation of the square roots modulo p , 1984 .

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

[46]  Henri Cohen,et al.  A course in computational algebraic number theory , 1993, Graduate texts in mathematics.

[47]  H. T. Kung.  On computing reciprocals of power series , 1974 .

[48]  Erich Kaltofen,et al.  Subquadratic-time factoring of polynomials over finite fields , 1998, Math. Comput..

[49]  Victor Y. Pan,et al.  Parallel least-squares solution of general and Toeplitz systems , 1990, SPAA '90.

[50]  R. Loos.  Computing in Algebraic Extensions , 1983 .

[51]  Arnold Schönhage,et al.  The fundamental theorem of algebra in terms of computational complexity - preliminary report , 1982 .

[52]  Erich Kaltofen,et al.  Challenges of Symbolic Computation: My Favorite Open Problems , 2000, J. Symb. Comput..

[53]  G. Rw.  Decision procedure for indefinite hypergeometric summation , 1978 .

[54]  Alfred V. Aho,et al.  Evaluating Polynomials at Fixed Sets of Points , 1975, SIAM J. Comput..

[55]  Daniel Reischert.  Asymptotically fast computation of subresultants , 1997, ISSAC.

[56]  R. Spence,et al.  Tellegen's theorem and electrical networks , 1970 .

[57]  Fritz von Haeseler,et al.  Irreducible Polynomials Generated by Decimations , 2001 .

[58]  Michael Clausen,et al.  Algebraic complexity theory , 1997, Grundlehren der mathematischen Wissenschaften.

[59]  Arnold Schönhage,et al.  Fast Parallel Computation of Characteristic Polynomials by Leverrier's POwer Sum Method Adapted to Fields of Finite Characteristic , 1993, ICALP.

[60]  R. W. Gosper.  Decision procedure for indefinite hypergeometric summation. , 1978, Proceedings of the National Academy of Sciences of the United States of America.

[61]  Victor Y. Pan,et al.  New Techniques for the Computation of Linear Recurrence Coefficients , 2000 .

[62]  Peter Henrici,et al.  Discrete Fourier analysis, Cauchy integrals, construction of conformal maps, univalent functions , 1986 .

[63]  Robert Harley,et al.  Counting Points on Hyperelliptic Curves over Finite Fields , 2000, ANTS.

[64]  Peter Paule,et al.  Greatest Factorial Factorization and Symbolic Summation , 1995, J. Symb. Comput..

[65]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[66]  Mark Giesbrecht,et al.  Shiftless decomposition and polynomial-time rational summation , 2003, ISSAC '03.

[67]  Éric Schost,et al.  Tellegen's principle into practice , 2003, ISSAC '03.

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

[69]  L. Carlitz,et al.  Irreducibles and the composed product for polynomials over a finite field , 1987, Discret. Math..

[70]  Dario Bini,et al.  Toeplitz matrices: Structures, algorithms and applications , 1996 .

[71]  C. Caldwell.  Mathematics of Computation , 1999 .

[72]  H. Niederreiter,et al.  On the Minimal Polynomial of the Product of Linear Recurring Sequences , 1995 .

[73]  P. Zimmermann,et al.  Speeding up the Division and Square Root of Power Series , 2000 .