✦ LIBER ✦

On the complexity of computing with zero-dimensional triangular sets

✍ Scribed by Adrien Poteaux; Éric Schost

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Computational Complexity of One-Dime

✍ Peter Bro Miltersen 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 125 KB

On the complexity of computing bilinear

✍ Teofilo Gonzalez; Joseph Ja'Ja' 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 903 KB

On the complexity of computations under

✍ David P. Dobkin; Richard J. Lipton 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 351 KB

Closed ideals with the zero-dimensional

✍ D. I. Gurevich 📂 Article 📅 1978 🏛 Springer US 🌐 English ⚖ 832 KB

On some iteration functions for the simu

✍ Miodrag S. Petković; Lidija V. Stefanović 📂 Article 📅 1987 🏛 Springer Netherlands 🌐 English ⚖ 482 KB

On the Complexity of Isolating Real Root

✍ B. Mourrain; M.N. Vrahatis; J.C. Yakoubsohn 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 217 KB