Probabilistic algorithms for computing resultants

@inproceedings{Monagan2005ProbabilisticAF,
  title={Probabilistic algorithms for computing resultants},
  author={Michael B. Monagan},
  booktitle={ISSAC},
  year={2005}
}
Let <i>A</i> and <i>B</i> be two polynomials in ℤ [<i>x,y</i>] and let <i>R</i> = res<inf>x</inf>(<i>A,B</i>) denote the resultant of <i>A</i> and <i>B</i> taken wrt <i>x</i>. In this paper we modify Collins' modular algorithm for computing <i>R</i> to make it output sensitive. The advantage of our algorithm is that it will be faster when the bounds needed by Collins' algorithm for the coefficients of <i>R</i> and for the degree of <i>R</i> are inaccurate. Our second contribution is an output… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

P

M. B. Monagan, K. O. Geddes, +3 authors J. McCarron
DeMarco. Maple 9 Introductory Programming Guide Waterloo Maple • 2003
View 9 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…