Fast change of ordering with exponent ω

ACM Communications in Computer Algebra

Volumn 46, Issue 3-4, 2013, Pages 92-93

  Faugère, Jean Charles ^a   Gaudry, Pierrick ^b   Huot, Louise ^a   Renault, Guénäel ^a  

^a INRIA ROCQUENCOURT   (France)

^b UNIVERSITÉ DE LORRAINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84872905716     PISSN: 19322232     EISSN: 19322240     Source Type: Journal    
DOI: 10.1145/2429135.2429149     Document Type: Conference Paper

References (10)

1. M. Bardet, J.-C. Faugère, and B. Salvy. Asymptotic expansion of the degree of regularity for semi-regular systems of equations. In P. Gianni, editor, The Effective Methods in Algebraic Geometry Conference, Mega 2005, pages 1-14, 2005.
2. J.-C. Faugère. A new efficient algorithm for computing Gröbner bases (F4). Journal of Pure and Applied Algebra, 139(1-3):61-88, June 1999.
3. J.-C. Faugère. A new efficient algorithm for computing Gröbner bases without reduction to zero (F5). In Proceedings of the 2002 international symposium on Symbolic and algebraic computation, ISSAC'02, pages 75-83, New York, NY, USA, 2002. ACM.
4. J.-C. Faugère, P. Gaudry, L. Huot, and G. Renault. Using symmetries in the index calculus for elliptic curves discrete logarithm. Cryptology ePrint Archive, Report 2012/199, 2012. http://eprint.iacr.org/.
5. J.-C. Faugère, P. Gianni, D. Lazard, and T. Mora. Efficient Computation of Zero-dimensional Gröbner Bases by Change of Ordering. Journal of Symbolic Computation, 16(4):329-344, 1993.
6. J.-C. Faugère and C. Mou. Fast Algorithm for Change of Ordering of Zero-dimensional Gröbner Bases with Sparse Multiplication Matrices. In ISSAC '11: Proceedings of the 2011 international symposium on Symbolic and algebraic computation, ISSAC '11, pages 1-8, New York, NY, USA, 2011. ACM.
7. J.-C. Faugère and C. Mou. Fast algorithm for change of ordering of zero-dimensional gröbner bases with sparse multiplication matrices (extended version), 2012. Article currently in progress.
8. W. Keller-Gehrig. Fast algorithms for the characteristic polynomial. Theor. Comput. Sci., 36:309-317, June 1985.
9. G. Moreno-Socias. Degrevlex gröbner bases of generic complete intersections. Journal of Pure and Applied Algebra, 180(3):263-283, 2003.
10. K. Pardue. Generic sequences of polynomials. Journal of Algebra, 324(4):579 - 590, 2010.