Solving systems of algebraic equations by using gröbner bases
From MaRDI portal
Publication:5393351
DOI10.1007/3-540-51517-8_127zbMath1209.13003OpenAlexW1592221065MaRDI QIDQ5393351
Publication date: 16 April 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-51517-8_127
Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (20)
An introduction to commutative and noncommutative Gröbner bases ⋮ The big mother of all dualities. 2: Macaulay bases ⋮ Radically solvable graphs ⋮ On the computation of parametric Gröbner bases for modules and syzygies ⋮ Deterministic neural networks optimization from a continuous and energy point of view ⋮ Towards a Gröbner-free approach to coding ⋮ A note on upper bounds for ideal-theoretic problems ⋮ Mechanical geometry theorem proving based on Gröbner bases ⋮ Comprehensive Gröbner bases ⋮ Improved decoding of affine-variety codes ⋮ Degree reduction under specialization ⋮ Cylinders Through Five Points: Complex and Real Enumerative Geometry ⋮ On the decoding of binary cyclic codes with the Newton identities ⋮ Decomposition of polynomial sets into characteristic pairs ⋮ Triangular sets for solving polynomial systems: a comparative implementation of four methods ⋮ A commutative algebra approach to linear codes ⋮ HELP: a sparse error locator polynomial for BCH codes ⋮ Degröbnerization: a political manifesto ⋮ On Gröbner bases under specialization ⋮ A new algorithm for discussing Gröbner bases with parameters.
This page was built for publication: Solving systems of algebraic equations by using gröbner bases
