Algorithms for computing triangular decomposition of polynomial systems

摘要

We discuss algorithmic advances which have extended the pio-neer work of Wu on triangular decompositions. We start with an overview of the key ideas which have led to either better imple-mentation techniques or a better understanding of the underlying theory. We then present new techniques that we regard as essen-tial to the recent success and for future research directions in the development of triangular decomposition methods.