COMPLEXITY OF VILLAMAYOR'S ALGORITHM IN THE NON-EXCEPTIONAL MONOMIAL CASE (Q5324404)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5589440
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | COMPLEXITY OF VILLAMAYOR'S ALGORITHM IN THE NON-EXCEPTIONAL MONOMIAL CASE |
scientific article; zbMATH DE number 5589440 |
Statements
COMPLEXITY OF VILLAMAYOR'S ALGORITHM IN THE NON-EXCEPTIONAL MONOMIAL CASE (English)
0 references
3 August 2009
0 references
Resolution of singularities
0 references
algorithm of resolution
0 references
monomial basic object
0 references
monoidal transform
0 references
complexity
0 references
Catalan numbers
0 references
0 references
0 references
0.7939760684967041
0 references
0.7889918684959412
0 references
