F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
暂无分享,去创建一个
[1] W. J. Thron,et al. Encyclopedia of Mathematics and its Applications. , 1982 .
[2] J. Faugère. A new efficient algorithm for computing Gröbner bases (F4) , 1999 .
[3] Heinz Kredel,et al. Gröbner Bases: A Computational Approach to Commutative Algebra , 1993 .
[4] Carlo Traverso,et al. Gröbner bases computation using syzygies , 1992, ISSAC '92.
[5] Daniel Lazard,et al. Gröbner-Bases, Gaussian elimination and resolution of systems of algebraic equations , 1983, EUROCAL.
[7] Jean Charles Faugère,et al. A new efficient algorithm for computing Gröbner bases without reduction to zero (F5) , 2002, ISSAC '02.
[8] Hans Schönemann,et al. SINGULAR: a computer algebra system for polynomial computations , 2001, ACCA.
[9] Jean-Charles Faugère,et al. Complexity of Gröbner basis computation for Semi-regular Overdetermined sequences over F_2 with solutions in F_2 , 2002 .
[10] Rüdiger Gebauer,et al. On an Installation of Buchberger's Algorithm , 1988, J. Symb. Comput..
[11] G. Greuel,et al. A Singular Introduction to Commutative Algebra , 2002 .
[12] Till Stegers,et al. Faugere's F5 Algorithm Revisited , 2006, IACR Cryptol. ePrint Arch..
[13] Chee-Keng Yap,et al. Fundamental problems of algorithmic algebra , 1999 .