Constructibility of the set of polynomials with a fixed Bernstein-Sato polynomial: an algorithmic approach. (Q5960298): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1006/jsco.2001.0488 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1006/JSCO.2001.0488 / rank | |||
Normal rank | |||
Revision as of 14:58, 8 December 2024
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
15 April 2002
0 references
Bernstein-Sato polynomials
0 references
algorithms
0 references
constructible sets of polynomials
0 references
0 references
0 references
