✦ LIBER ✦

Polynomial Factorization: Sharp Bounds, Efficient Algorithms

✍ Scribed by Bernard Beauzamy; Vilmar Trevisan; Paul S. Wang

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sharp Bounds on Interval Polynomial Root

✍ Eldon R. Hansen; G. William Walster 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 84 KB

Sharp Bounds for Harmonic Polynomials

✍ Armitage, D. H.; Kuran, U. 📂 Article 📅 1990 🏛 Oxford University Press 🌐 English ⚖ 284 KB

Effective Fast Algorithms for Polynomial

✍ D.A. Bini; G. Fiorentino; L. Gemignani; B. Meini 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 103 KB

New Algorithms for Polynomial J-Spectral

✍ Harry L. Trentelman; Paolo Rapisarda 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 356 KB

Randomized Algorithms for Low-Rank Matri

✍ Witten, Rafi; Candès, Emmanuel 📂 Article 📅 2014 🏛 Springer 🌐 English ⚖ 304 KB

Polynomial algorithm for sharp upper bou

✍ Xing-Chao Deng; Kai-Nan Xiang; Baoyindureng Wu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 334 KB