Looking at a set of equations
暂无分享,去创建一个
This working paper* describes our experiences with using the Gröbner-basis method [Buchberger, 1985] to solve some related systems of polynomial equations. While we have not yet been able to solve the system that was our primary motivation, we feel that these experiences may prove useful to others investigating Buchberger’s algorithm in this context, especially when, as is the case for the system under investigation, the equations are highly structured. We conclude with some examples of the polynomials that we factored in the course of this investigation. * This is a 1989 reprint of a paper originally published in 1987. We have taken the opportunity to correct a few typographical errors.
[1] David R. Musser,et al. On the Efficiency of a Polynomial Irreducibility Test , 1978, JACM.