Author:
Horáček Jan,Kreuzer Martin,Messeng Ekossono Ange-Salomé
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Computational Mathematics
Reference15 articles.
1. Buchberger, B.: Bruno Buchberger’s Ph.D. thesis 1965: an algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. J. Symb. Comput. 41, 475–511 (2006)
2. Faugère, J.-C.: A new efficient algorithm for computing Gröbner bases without reduction to zero (F5). In: Proc. Conf. ISSAC 2002, pp. 75–83. ACM Press, New York (2002)
3. Eder, C., Faugère, J.-C.: A survey on signature-based algorithms for computing Gröbner bases. J. Symb. Comput. 80, 719–784 (2017)
4. Mourrain, B.: A new criterion for normal form algorithms. In: Fossorier, M., Imai, H., Lin, S., Poli, A. (eds.) Proc. Conf. AAECC-13, Honolulu 1999, LNCS, Vol. 1719, pp. 440–443. Springer, Heidelberg (1999)
5. Kehrein, A., Kreuzer, M.: Computing border bases. J. Pure Appl. Alg. 205, 279–295 (2006)