✦ LIBER ✦

Complexity bounds for the rational Newton-Puiseux algorithm over finite fields

✍ Scribed by Adrien Poteaux; Marc Rybowicz

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved upper bounds for the number of

✍ Kristin Lauter 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 285 KB

Multiplicative complexity of bilinear al

✍ Salvatore D. Morgera 📂 Article 📅 1990 🏛 Springer US 🌐 English ⚖ 877 KB

Randomized Algorithms over Finite Fields

✍ Giulia Galbiati; Francesco Maffioli; Carlo Viola 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 193 KB

On a Finite Branch and Bound Algorithm f

✍ Vasilios I. Manousiouthakis; Neil Thomas; Ahmad M. Justanieah 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 460 KB

A simple criterion for them-cyclicity of

✍ Hugues Verdure 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 130 KB