A modified LLL algorithm for change of ordering of Grobner basis | ||
| International Journal of Nonlinear Analysis and Applications | ||
| مقاله 7، دوره 4، شماره 1، 2013، صفحه 59-65 اصل مقاله (359.14 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22075/ijnaa.2013.27 | ||
| نویسندگان | ||
| M. Borujeni؛ A. Basiri* ؛ S. Rahmany؛ A. H. Borzabadi | ||
| School of Mathematics and Computer Science, Damghan University, Damghan, Iran | ||
| چکیده | ||
| In this paper, a modified version of LLL algorithm, which is a an algorithm with output-sensitive complexity, is presented to convert a given Grobner basis with respect to a specific order of a polynomial ideal I in arbitrary dimensions to a Grobner basis of I with respect to another term order. Also a comparison with the FGLM conversion and Buchberger method is considered. | ||
| کلیدواژهها | ||
| Grobner Basis؛ LLL Algorithm؛ Reduced Lattice Basis | ||
|
آمار تعداد مشاهده مقاله: 18,443 تعداد دریافت فایل اصل مقاله: 13,004 |
||
| تعداد نشریات | 22 |
| تعداد شمارهها | 723 |
| تعداد مقالات | 10,396 |
| تعداد مشاهده مقاله | 72,863,653 |
| تعداد دریافت فایل اصل مقاله | 64,556,972 |