On computing absolutely irreducible components of algebraic varieties with parameters
From MaRDI portal
Publication:5962004
Recommendations
- On factoring parametric multivariate polynomials
- Complexity of solving parametric polynomial systems
- Complexity bound for the absolute factorization of parametric polynomials
- Counting irreducible components of complex algebraic varieties
- An algorithm for solving zero-dimensional parametric systems of polynomial homogeneous equations
Cites work
- scientific article; zbMATH DE number 3503388 (Why is no real title available?)
- scientific article; zbMATH DE number 1263377 (Why is no real title available?)
- scientific article; zbMATH DE number 1952043 (Why is no real title available?)
- scientific article; zbMATH DE number 2110642 (Why is no real title available?)
- scientific article; zbMATH DE number 806915 (Why is no real title available?)
- A Gröbner free alternative for polynomial system solving
- A new algorithm for discussing Gröbner bases with parameters.
- Algebraic Geometry. I: Complex projective varieties.
- Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
- Bounds on numers of vectors of multiplicities for polynomials which are easy to compute
- Complexity of the resolution of parametric systems of polynomial equations and inequations
- Complexity results for triangular sets
- Comprehensive Gröbner bases
- Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
- Computing parametric geometric resolutions
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Definability and fast quantifier elimination in algebraically closed fields
- Deformation techniques for efficient polynomial equation solving.
- Effective equidimensional decomposition of affine varieties
- Factorization of polynomials over a finite field and the solution of systems of algebraic equations
- Gröbner bases and primary decomposition of polynomial ideals
- Lower bounds for diophantine approximations
- Minimal canonical comprehensive Gröbner systems
- Minimal primary decomposition and factorized Gröbner bases
- Numerical decomposition of the solution sets of polynomial systems into irreducible components
- Sharp estimates for triangular sets
- Solving parametric polynomial systems
- Solving polynomial equations. Foundations, algorithms, and applications
- Solving zero-dimensional systems through the rational univariate representation
- The complexity of the word problems for commutative semigroups and polynomial ideals
- Vandermonde matrices, NP-completeness and transversal subspaces
Cited in
(10)- Sets of special subvarieties of bounded degree
- Efficient absolute factorization of polynomials with parametric coefficients
- An algorithm for solving zero-dimensional parametric systems of polynomial homogeneous equations
- On a generalization of Stickelberger's theorem
- Effective construction of local parameters of irreducible components of an algebraic variety.
- On factorization of parametric polynomials
- Computations with parameters: a theoretical background
- On factoring parametric multivariate polynomials
- Complexity bound for the absolute factorization of parametric polynomials
- Computational algorithm for reduction type of CM abelian varieties
This page was built for publication: On computing absolutely irreducible components of algebraic varieties with parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962004)
