✦ LIBER ✦

Probabilistic computation of integer polynomial GCDs

✍ Scribed by A Schönhage

Book ID: 103628250
Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 366 KB
Volume: 9
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(88)90027-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximate polynomial GCD over integers

✍ Kosaku Nagasaka 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 268 KB

Computation of Approximate Polynomial GC

Computation of Approximate Polynomial GCDs and an Extension

✍ Victor Y Pan 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 110 KB

Computing GCDs of Polynomials over Algeb

Computing GCDs of Polynomials over Algebraic Number Fields

✍ Mark J. Encarnación 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 510 KB

A subspace method for the computation of

A subspace method for the computation of the GCD of polynomials

✍ Wanzhi Qiu; Yingbo Hua; Karim Abed-Meraim 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 279 KB

On Approximate GCDs of Univariate Polyno

On Approximate GCDs of Univariate Polynomials

✍ N.K. Karmarkar; Y.N. Lakshman 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 403 KB

In this paper, we consider computations involving polynomials with inexact coefficients, i.e. with bounded coefficient errors. The presence of input errors changes the nature of questions traditionally asked in computer algebra. For instance, given two polynomials, instead of trying to compute their

Computation of the GCD of polynomials of

Computation of the GCD of polynomials of several variables on a MPC

✍ Yu. V. Rybakova; T. N. Smirnova 📂 Article 📅 1980 🏛 Springer US 🌐 English ⚖ 298 KB