Constructibility of the set of polynomials with a fixed Bernstein-Sato polynomial: an algorithmic approach.

From MaRDI portal
Publication:5960298


DOI10.1006/jsco.2001.0488zbMath1035.16018MaRDI QIDQ5960298

Anton Leykin

Publication date: 15 April 2002

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.2001.0488


68W30: Symbolic computation and algebraic computation

16S32: Rings of differential operators (associative algebraic aspects)


Related Items



Cites Work