On the complexity of computing gröbner bases for quasi-homogeneous systems
From MaRDI portal
Publication:2963233
DOI10.1145/2465506.2465943zbMath1360.68930arXiv1301.5612OpenAlexW2461870278MaRDI QIDQ2963233
Thibaut Verron, Jean-Charles Faugère, Mohab Safey El Din
Publication date: 10 February 2017
Published in: Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.5612
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
A survey on signature-based algorithms for computing Gröbner bases ⋮ Matrix-F5 algorithms over finite-precision complete discrete valuation fields ⋮ Using symmetries in the index calculus for elliptic curves discrete logarithm ⋮ Computation of invariants of finite abelian groups ⋮ On the complexity of computing Gröbner bases for weighted homogeneous systems ⋮ Pairing inversion for finding discrete logarithms
This page was built for publication: On the complexity of computing gröbner bases for quasi-homogeneous systems
