The computational complexity of the Chow form
From MaRDI portal
Abstract: We present a bounded probability algorithm for the computation of the Chow forms of the equidimensional components of an algebraic variety. Its complexity is polynomial in the length and in the geometric degree of the input equation system defining the variety. In particular, it provides an alternative algorithm for the equidimensional decomposition of a variety. As an application we obtain an algorithm for the computation of a subclass of sparse resultants, whose complexity is polynomial in the dimension and the volume of the input set of exponents. As a further application, we derive an algorithm for the computation of the (unique) solution of a generic over-determined equation system.
Recommendations
- Computing Chow forms and some applications
- The complexity of higher Chow groups
- The complexity to compute the Euler characteristic of complex varieties
- Explicit computation of the Chern character forms
- scientific article; zbMATH DE number 2070405
- A combinatoric shortcut to evaluate CHY-forms
- Computing the Chow variety of quadratic space curves
- scientific article; zbMATH DE number 38433
- scientific article; zbMATH DE number 4083786
- Computation of paramodular forms
Cited in
(34)- Effective approximation of the solutions of algebraic equations
- On arithmetical bounds of Chow-forms
- Intersection theory in differential algebraic geometry: generic intersections and the differential Chow form
- A package for computations with sparse resultants
- Computing multihomogeneous resultants using straight-line programs
- A concise proof of the Kronecker polynomial system solver from scratch
- Degeneracy loci and polynomial equation solving
- Change of order for regular chains in positive dimension
- Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin)
- Difference Chow form
- Elimination theory in differential and difference algebra
- Computing isolated roots of sparse polynomial systems in affine space
- Puiseux expansions and nonisolated points in algebraic varieties
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Implicit representations of high-codimension varieties
- Deformation techniques for sparse systems
- Partial differential Chow forms and a type of partial differential Chow varieties
- Variety evasive subspace families
- Computing Chow forms and some applications
- Computing generators of the ideal of a smooth affine algebraic variety
- A Poisson formula for the sparse resultant
- Evaluation techniques for zero-dimensional primary decomposition
- On a generalization of Stickelberger's theorem
- Rational univariate reduction via toric resultants
- Segre-driven radicality testing
- Computation of differential Chow forms for ordinary prime differential ideals
- Computing real radicals and \(S\)-radicals of polynomial systems
- Elimination for generic sparse polynomial systems
- Sparse resultants and straight-line programs
- Chow form for projective differential variety
- Rational formulas for traces in zero-dimensional algebras
- The geometry of the flex locus of a hypersurface
- Sparse differential resultant for Laurent differential polynomials
- On the complexity of Chow and Hurwitz forms
This page was built for publication: The computational complexity of the Chow form
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1879037)
