✦ LIBER ✦

Sparse shifts for univariate polynomials

✍ Scribed by Y. N. Lakshman; B. David Saunders

Publisher: Springer
Year: 1996
Tongue: English
Weight: 840 KB
Volume: 7
Category: Article
ISSN: 0938-1279
DOI: 10.1007/bf01293594

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sparse Shifts for Univariate Polynomials

✍ Y. N. Lakshman; B. David Saunders 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 90 KB

Algorithms for Computing Sparse Shifts f

Algorithms for Computing Sparse Shifts for Multivariate Polynomials

✍ Dima Yu. Grigoriev; Y. N. Lakshman 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 196 KB

Improved Techniques for Factoring Univar

Improved Techniques for Factoring Univariate Polynomials

✍ GEORGE E. COLLINS; MARK J. ENCARNACIÓN 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 563 KB

The paper describes improved techniques for factoring univariate polynomials over the integers. The authors modify the usual linear method for lifting modular polynomial factorizations so that efficient early factor detection can be performed. The new lifting method is universally faster than the cl

A heuristic irreducibility test for univ

A heuristic irreducibility test for univariate polynomials

✍ Michael B. Monagan 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 610 KB

Efficient p-adic Cell Decompositions for

Efficient p-adic Cell Decompositions for Univariate Polynomials

✍ Michael Maller; Jennifer Whitehead 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 177 KB

Cell decompositions are constructed for polynomials f (x) # Z p [x] of degree n, such that n< p, using O(n 2 ) cells. When f is square-free this yields a polynomialtime algorithm for counting and approximating roots in Z p . These results extend to give a polynomial-time algorithm in the bit model f

Bounds for resultants of univariate and

Bounds for resultants of univariate and bivariate polynomials

✍ Yuval Bistritz; Alexander Lifshitz 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 166 KB