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

From MaRDI portal
Revision as of 02:26, 30 January 2024 by Import240129110155 (talk | contribs) (Added link to MaRDI item.)
scientific article; zbMATH DE number 1727968
Language Label Description Also known as
English
Constructibility of the set of polynomials with a fixed Bernstein-Sato polynomial: an algorithmic approach.
scientific article; zbMATH DE number 1727968

    Statements

    Constructibility of the set of polynomials with a fixed Bernstein-Sato polynomial: an algorithmic approach. (English)
    0 references
    0 references
    15 April 2002
    0 references
    0 references
    Bernstein-Sato polynomials
    0 references
    algorithms
    0 references
    constructible sets of polynomials
    0 references