✦ LIBER ✦

Fast Algorithms for Zero-Dimensional Polynomial Systems using Duality

✍ Scribed by Alin Bostan; Bruno Salvy; Éric Schost

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A polynomially stable fast parallel algo

✍ Yu.M. Nechepurenko 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 425 KB

A novel modularized fast polynomial tran

✍ Ja-Ling Wu; Yuh-Ming Huang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 506 KB

A globally convergent parallel algorithm

✍ Alexander P. Morgan; Layne T. Watson 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 952 KB

Fast algorithms for computing one- and t

✍ H. Krishna Garg; C. C. Ko 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 871 KB

A Fast Shadowing Algorithm for High-Dime

✍ Hayes, Wayne B.; Jackson, Kenneth R. 📂 Article 📅 2007 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 255 KB

A fast computation algorithm of the two-

✍ Yoshitaka Morikawa; Hiroshi Hamada; Kazuyoshi Watabu 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 775 KB