✦ LIBER ✦

The optimal read-once branching program complexity for the direct storage access function

✍ Scribed by Beate Bollig

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the size of randomized OBDDs and read

✍ M. Sauerhoff 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 392 KB

Directional derivative estimates for the

✍ Bernd Luderer 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 799 KB

A lower bound on the computation complex

✍ E. A. Okol’nishnikova 📂 Article 📅 2010 🏛 Pleiades Publishing 🌐 English ⚖ 490 KB