A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Algorithms for computing triangular decompositions of polynomial systems
2011
Proceedings of the 36th international symposium on Symbolic and algebraic computation - ISSAC '11
We discuss algorithmic advances which have extended the pioneer work of Wu on triangular decompositions. We start with an overview of the key ideas which have led to either better implementation techniques or a better understanding of the underlying theory. We then present new techniques that we regard as essential to the recent success and for future research directions in the development of triangular decomposition methods.
doi:10.1145/1993886.1993904
dblp:conf/issac/ChenM11
fatcat:l4pki44enrawnhrvnxomxns4r4