✦ LIBER ✦

The Complexity of Read-Once Resolution

✍ Scribed by Hans Kleine Büning; Xishun Zhao

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower Bounds on the Randomized Communica

✍ Nikos Leonardos; Michael Saks 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 583 KB

The optimal read-once branching program

✍ Beate Bollig 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 105 KB

On read-once threshold formulae and thei

✍ Rafi Heiman; Ilan Newman; Avi Wigderson 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 865 KB

Combinatorial characterization of read-o

✍ M. Karchmer; N. Linial; I. Newman; M. Saks; A. Wigderson 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 475 KB

Resolution of space curves complexity

✍ Julio Castellanos 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 656 KB

On the shrinkage exponent for read-once

✍ Johan Håstad; Alexander Razborov; Andrew Yao 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 767 KB