✦ LIBER ✦

A randomized algorithm for finding maximum with O((log n)2) polynomial tests

✍ Scribed by Hing F. Ting; Andrew C. Yao

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(n-log-log-n) Time Algorithm for Con

✍ T. Asano 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 601 KB

A probabilistic algorithm for verifying

✍ Tracy Kimbrel; Rakesh Kumar Sinha 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 376 KB

Balanced network flows. VIII. A revised

✍ Christian Fremuth-Paeger; Dieter Jungnickel 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB 👁 1 views