scientific article; zbMATH DE number 5168256
From MaRDI portal
Publication:3447182
Recommendations
- Zero decomposition algorithms for systems of polynomial equations
- scientific article; zbMATH DE number 1383108
- On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection
- An extension of Buchberger's algorithm to compute all reduced Gröbner bases of a polynomial ideal
- Deterministically Computing Reduction Numbers of Polynomial Ideals
- Approximate computation of zero-dimensional polynomial ideals
- Polynomial-time algorithms for a new model of representation of algebraic varieties (in characteristic zero)
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- scientific article; zbMATH DE number 4212207
- Polynomial-time computation of the degree of algebraic varieties in zero characteristic and its applications.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3447182)