Greatest common divisors of polynomials given by straight-line programs

@article{Kaltofen1988GreatestCD,
  title={Greatest common divisors of polynomials given by straight-line programs},
  author={Erich Kaltofen},
  journal={J. ACM},
  year={1988},
  volume={35},
  pages={231-264}
}
Algorithms on multivariate polynomials represented by straight-line programs are developed. First, it is shown that most algebraic algorithms can be probabilistically applied to data that are given by a straight-line computation. Testing such rational numeric data for zero, for instance, is facilitated by random evaluations modulo random prime numbers. Then, auxiliary algorithms that determine the coefficients of a multivariate polynomial in a single variable are constructed. The first main… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 79 CITATIONS

Modular Composition Modulo Triangular Sets and Applications

  • computational complexity
  • 2013
VIEW 8 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

On the complexity of computing with zero-dimensional triangular sets

  • J. Symb. Comput.
  • 2011
VIEW 7 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

On Computing Determinants of Matrices without Divisions

VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

A Unified Approach to HGCD Algorithms for polynomials and integers

VIEW 9 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Evaluation properties of invariant polynomials

  • J. Symb. Comput.
  • 2009
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Computing Chow Forms and Some Applications

VIEW 2 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1986
2018

CITATION STATISTICS

  • 12 Highly Influenced Citations

References

Publications referenced by this paper.

On Polynomials with Symmetric Galois Group which Are Easy to Compute

  • Theor. Comput. Sci.
  • 1986
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL