| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10325492 | Journal of Symbolic Computation | 2005 | 24 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Mathias Schulze,