Good bases for tame polynomials
arXiv:math/0306120 · doi:10.1016/j.jsc.2004.10.001
Abstract
An algorithm to compute a good basis of the Brieskorn lattice of a cohomologically tame polynomial is described. This algorithm is based on the results of C. Sabbah and generalizes the algorithm by A. Douai for convenient Newton non-degenerate polynomials.
28 pages, 0 figures, http://www.mathematik.uni-kl.de/~mschulze