✦ LIBER ✦

A Polynomial Time Complexity Bound for Computations on Curves

✍ Scribed by Walsh, P. G.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Lower Bound on the Complexity of Polyn

✍ Kaminski, Michael 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 338 KB

A polynomial time bound for Howard's pol

✍ U. Meister; U. Holzbaur 📂 Article 📅 1986 🏛 Springer 🌐 German ⚖ 225 KB

A simple complexity proof for a polynomi

✍ Paul Tseng 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 319 KB

A time complexity lower bound for adapti

✍ Yong-Jik Kim; James H. Anderson 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 676 KB

An upper bound on the independence numbe

✍ Carlos J. Luz 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 450 KB

An improvement of the complexity bound f

✍ A. L. Chistov 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 235 KB