✦ LIBER ✦

Factoring bivariate polynomials using adjoints

✍ Scribed by Weimann, Martin

Book ID: 121309640
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 388 KB
Volume: 58
Category: Article
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2013.05.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sparse bivariate polynomial factorizatio

Sparse bivariate polynomial factorization

✍ WenYuan Wu,JingWei Chen,Yong Feng 📂 Article 📅 2014 🏛 SP Science China Press 🌐 English ⚖ 309 KB

Factoring polynomials using fewer random

Factoring polynomials using fewer random bits

✍ Eric Bach; Victor Shoup 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 629 KB

Let F be a field of q = p" elements, where p is prime. We present two new probabilistic algorithms for factoring polynomials in FIX] that make particularly efficient use of random bits. They are easy to implement, and require no randomness beyond an initial seed whose length is proportional to the i

Factoring polynomials using binary repre

Factoring polynomials using binary representations of finite fields

✍ Ganz, J. 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 857 KB

GCDs and factoring multivariate polynomi

GCDs and factoring multivariate polynomials using Groebner bases

✍ Gianni, Trager. 📂 Library 📅 1985 🏛 EUROCAL 🌐 English ⚖ 44 KB

Multi-Modular Approach to Polynomial-Tim

Multi-Modular Approach to Polynomial-Time Factorization of Bivariate Integral Polynomials

✍ Kazuhiro Yokoyama; Masayuki Noro; Taku Takeshima 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 685 KB

Efficient algorithms to factorize bivariate integral polynomials are discussed. As a key technique to provide the most efficient algorithms in theory, an approach, named multimodular approach, is proposed and its implication is discussed intensively. The approach uses combined information from sever

Reduction to bivariate and univariate po

Reduction to bivariate and univariate polynomial factorization 1985

✍ Kaltofen. 📂 Library 🌐 English ⚖ 83 KB