✦ LIBER ✦

The area-time complexity of the greatest common divisor problem: a lower bound

✍ Scribed by Carla Neaderhouser Purdy; George B. Purdy

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound on the single-operation wo

✍ Norbert Blum; Henning Rochow 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 317 KB

Lower bounds on the area complexity of B

✍ Juraj Hromkovič; Sergej A. Ložkin; Andrej I. Rybko; Alexander A. Sapoženko; Nade 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 1001 KB

A 3n-lower bound on the network complexi

✍ C.P. Schnorr 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 972 KB

A lower bound for the nondeterministic s

✍ Helmut Alt; Viliam Geffert; Kurt Mehlhorn 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 241 KB

A lower bound on the computational compl

✍ Eric Goles; Marcos Kiwi 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 483 KB

A Lower Bound on the Number of Solutions

✍ L.A. Newberg; D. Naor 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 396 KB