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

From MaRDI portal
Revision as of 02:26, 30 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5960298

DOI10.1006/jsco.2001.0488zbMath1035.16018OpenAlexW2075963597MaRDI 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




Related Items



Cites Work


This page was built for publication: Constructibility of the set of polynomials with a fixed Bernstein-Sato polynomial: an algorithmic approach.