An effective construction of a small number of equations defining an algebraic variety
From MaRDI portal
Publication:2146178
Recommendations
- Solving systems of algebraic equations
- Polynomial complexity of solving systems of few algebraic equations with small degrees
- Effective construction of an algebraic variety nonsingular in codimension one over a ground field of zero characteristic
- scientific article; zbMATH DE number 3893304
- Polynomial-time computation of the degree of algebraic varieties in zero characteristic and its applications.
Cites work
- scientific article; zbMATH DE number 3897078 (Why is no real title available?)
- scientific article; zbMATH DE number 3893304 (Why is no real title available?)
- Bemerkung zu einem Satz von M. Kneser
- Every algebraic set in n-space is the intersection of n hypersurfaces
- Polynomial Remainder Sequences and Determinants
- Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. I
Cited in
(6)- Reducing the number of equations defining a subset of the \(n\)-space over a finite field
- Effective construction of an algebraic variety nonsingular in codimension one over a ground field of zero characteristic
- Polynomial-time algorithms for a new model of representation of algebraic varieties (in characteristic zero)
- Truncation of systems of polynomial equations, ideals and varieties
- scientific article; zbMATH DE number 1958631 (Why is no real title available?)
- scientific article; zbMATH DE number 3771757 (Why is no real title available?)
This page was built for publication: An effective construction of a small number of equations defining an algebraic variety
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2146178)
