✦ LIBER ✦

New recombination algorithms for bivariate polynomial factorization based on Hensel lifting

✍ Scribed by Grégoire Lecerf

Publisher: Springer
Year: 2010
Tongue: English
Weight: 341 KB
Volume: 21
Category: Article
ISSN: 0938-1279
DOI: 10.1007/s00200-010-0121-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lattices and Algorithms for Bivariate Be

Lattices and Algorithms for Bivariate Bernstein, Lagrange, Newton, and Other Related Polynomial Bases Based on Duality betweenL-Bases andB-Bases

✍ Suresh Kumar Lodha; Ron Goldman 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 738 KB

L-Bases and B-bases are two important classes of polynomial bases used for representing surfaces in approximation theory and computer aided geometric design. It is well known that the Bernstein and multinomial (or Taylor) bases are special cases of both L-bases and B-bases. We establish that certain

A polynomial-time algorithm for linear o

A polynomial-time algorithm for linear optimization based on a new class of kernel functions

✍ M. El Ghami; I. Ivanov; J.B.M. Melissen; C. Roos; T. Steihaug 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 721 KB