Constructibility of the set of polynomials with a fixed Bernstein-Sato polynomial: an algorithmic approach. (Q5960298)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Constructibility of the set of polynomials with a fixed Bernstein-Sato polynomial: an algorithmic approach. |
scientific article; zbMATH DE number 1727968
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7968621850013733
0 references
0.7800257802009583
0 references
0.7731459140777588
0 references
