کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
401591 | 675389 | 2013 | 32 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Bounds on factors in Z[x]
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Bounds on factors in Z[x] Bounds on factors in Z[x]](/preview/png/401591.png)
چکیده انگلیسی
We gather together several bounds on the sizes of coefficients which can appear in factors of polynomials in Z[x]; we include a new bound which was latent in a paper by Mignotte, and a few improvements to some existing bounds. We compare these bounds, and for each bound give explicit examples where that bound is the best; thus showing that no one bound is universally better than the others. In the second part of the paper we give several concrete examples of factorizations where the factors have “unexpectedly” large coefficients. These examples help us understand why the bounds must be larger than you might expect, and greatly extend the collection published by Collins.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Symbolic Computation - Volume 50, March 2013, Pages 532-563
Journal: Journal of Symbolic Computation - Volume 50, March 2013, Pages 532-563