✦ LIBER ✦

On WLCDs and the Complexity of Word-Level Decision Diagrams—A Lower Bound for Division

✍ Scribed by Christoph Scholl; Bernd Becker; Thomas Weis

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Lower Bound on the Complexity of Divis

✍ Lickteig, Thomas 📂 Article 📅 1989 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 701 KB

A spectral lower bound technique for the

✍ Brandman, Y.; Orlitsky, A.; Hennessy, J. 📂 Article 📅 1990 🏛 IEEE 🌐 English ⚖ 529 KB

A Lower Bound on the Complexity of Polyn

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

A Near-Tight Lower Bound on the Time Com

✍ Peleg, David; Rubinovich, Vitaly 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 250 KB

A $4n$ Lower Bound on the Combinational

✍ Zwick, Uri 📂 Article 📅 1991 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 747 KB