On the complexity of computing Gröbner bases for weighted homogeneous systems
From MaRDI portal
Publication:5963397
DOI10.1016/j.jsc.2015.12.001zbMath1430.13044arXiv1412.7547OpenAlexW2188410026MaRDI QIDQ5963397
Mohab Safey El Din, Jean-Charles Faugère, Thibaut Verron
Publication date: 19 February 2016
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.7547
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (2)
Toric eigenvalue methods for solving sparse polynomial systems ⋮ Dimension results for extremal-generic polynomial systems over complete toric varieties
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using symmetries in the index calculus for elliptic curves discrete logarithm
- Hilbert functions and the Buchberger algorithm
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
- Generic sequences of polynomials
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- The Magma algebra system. I: The user language
- Converting bases with the Gröbner walk
- On variations of the subset sum problem
- Degrevlex Gröbner bases of generic complete intersections.
- A weighted module view of integral closures of affine domains of type I
- On the complexity of computing gröbner bases for quasi-homogeneous systems
- FGLM-Like Decoding: from Fitzpatrick’s Approach to Recent Developments
- An inequality for Hilbert series of graded algebras.
- On Complete Intersections and Their Hilbert Functions
- FGb: A Library for Computing Gröbner Bases
- Algorithms in invariant theory
This page was built for publication: On the complexity of computing Gröbner bases for weighted homogeneous systems
