Effective Hironaka resolution and its Complexity (with appendix on applications in positive characteristic)
From MaRDI portal
Publication:6233686
Abstract: Building upon works of Hironaka, Bierstone-Milman, Villamayor and Wlodarczyk, we give an a priori estimate for the complexity of the simplified Hironaka algorithm. As a consequence of this result, we show that there exists canonical Hironaka embedded desingularization and principalization over fields of large characteristic (relative to the degrees of generating polynomials).
This page was built for publication: Effective Hironaka resolution and its Complexity (with appendix on applications in positive characteristic)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6233686)
