✦ LIBER ✦

A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields

✍ Scribed by Kaminski, Michael

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of sparse polynomial inte

✍ Kai Werther 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 650 KB

On lower bounds for the complexity of po

✍ W. Baur; K. Halupczok 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 207 KB

A lower bound for the multiplication of

✍ Nader H. Bshouty 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 415 KB

On the deterministic complexity of facto

✍ Victor Shoup 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 792 KB

Lower bound on minimum Lee distance of a

✍ Wu, X.-W.; Kuijper, M.; Udaya, P. 📂 Article 📅 2007 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 66 KB

On the Bounds of the Bilinear Complexity

✍ Stéphane Ballet; Jean Chaumine 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 123 KB