Details:
| Title | Constructibility of the Set of Polynomials with a
Fixed Bernstein-Sato Polynomial: an Algorithmic
Approach | | Author(s) | Anton Leykin | | Type | Article in Journal | | Length | 13 | | ISSN | 0747-7171 (print), 1095-855X ( |
| Language | English | | Journal | Journal of Symbolic Computation | | Volume | 32 | | Number | 6 | | Pages | 663--675 | | Year | 2001 | | Translation |
No | | Refereed |
Yes |
|
