Computational aspects of singularities
From MaRDI portal
Recommendations
Cited in
(20)- A smoothness test for higher codimensions
- Towards massively parallel computations in algebraic geometry
- Three algorithms in algebraic geometry, coding theory and singularity theory
- Desingularization algorithms: a comparison from the practical point of view
- Desingularization in computational applications and experiments
- The Computational Complexity of the Resolution of Plane Curve Singularities
- scientific article; zbMATH DE number 1302477 (Why is no real title available?)
- About the computation of the signature of surface singularities \(z ^{N } + g(x, y) = 0\)
- Algorithms for checking rational roots of b-functions and their applications
- scientific article; zbMATH DE number 1466282 (Why is no real title available?)
- Computational Aspects of Classifying Singularities
- Desingularization of Arithmetic Surfaces: Algorithmic Aspects
- scientific article; zbMATH DE number 1860724 (Why is no real title available?)
- Computations in the neighbourhood of algebraic singularities
- scientific article; zbMATH DE number 1420931 (Why is no real title available?)
- Embedded desingularization for arithmetic surfaces -- toward a parallel implementation
- A semi-canonical reduction for periods of Kontsevich–Zagier
- Two computational techniques for singularity resolution
- Computational hyperbolicity
- A modified coefficient ideal for use with the strict transform
This page was built for publication: Computational aspects of singularities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5755423)