✦ LIBER ✦

Exploiting communication complexity for Boolean matching

✍ Scribed by Kuo-Hua Wang; TingTing Hwang; Cheng Chen

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Exploiting communication complexity for

✍ Hwang, T.-T.; Owens, R.M.; Irwin, M.J. 📂 Article 📅 1990 🏛 IEEE 🌐 English ⚖ 1002 KB

Boolean Circuits, Tensor Ranks, and Comm

✍ Pudlák, Pavel; Rödl, Vojtech; Sgall, Jirí 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 481 KB

Exploiting Symmetries to Speed Up SAT-Ba

✍ Yu Hu; Shih, V.; Majumdar, R.; Lei He 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 731 KB

Exploiting Regularities for Boolean Func

✍ Anna Bernasconi; Valentina Ciriani; Fabrizio Luccio; Linda Pagli 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 219 KB

Complexity hierarchies for Boolean funct

✍ William F. McColl 📂 Article 📅 1978 🏛 Springer-Verlag 🌐 English ⚖ 241 KB

Boolean matching for incompletely specif

✍ Kuo-Hua Wang; TingTing Hwang 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 361 KB