Solving polynomial equation systems. Vol. III: Algebraic solving
From MaRDI portal
Recommendations
Cited in
(14)- On the bit complexity of polynomial system solving
- scientific article; zbMATH DE number 1276814 (Why is no real title available?)
- scientific article; zbMATH DE number 1952043 (Why is no real title available?)
- An FGLM-like algorithm for computing the radical of a zero-dimensional ideal
- scientific article; zbMATH DE number 2166957 (Why is no real title available?)
- scientific article; zbMATH DE number 1827070 (Why is no real title available?)
- The classification of smooth well-formed Fano weighted complete intersections
- Oracle-supported drawing of the Gröbner \textit{escalier}
- Bar code and Janet-like division
- The area method in the Wolfram language
- Fourteen years of cube attacks
- Algebraic and SAT models for SCA generation
- HELP: a sparse error locator polynomial for BCH codes
- Introduction to the solution of polynomial systems
This page was built for publication: Solving polynomial equation systems. Vol. III: Algebraic solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5251741)