✦ LIBER ✦

Lower Bounds on the Randomized Communication Complexity of Read-Once Functions

✍ Scribed by Nikos Leonardos; Michael Saks

Publisher: Springer
Year: 2010
Tongue: English
Weight: 583 KB
Volume: 19
Category: Article
ISSN: 1016-3328
DOI: 10.1007/s00037-010-0292-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower Bounds on the Multiparty Communica

Lower Bounds on the Multiparty Communication Complexity

✍ Pavol Ďuriš; José D.P. Rolim 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 236 KB

On the size of randomized OBDDs and read

On the size of randomized OBDDs and read-once branching programs for k-stable functions

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

Lower bounds on the area complexity of B

Lower bounds on the area complexity of Boolean circuits

✍ Juraj Hromkovič; Sergej A. Ložkin; Andrej I. Rybko; Alexander A. Sapoženko; Nade 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 1001 KB

Lower bounds on monotone complexity of t

Lower bounds on monotone complexity of the logical permanent

✍ A. A. Razborov 📂 Article 📅 1985 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 619 KB

On lower bounds of the closeness between

On lower bounds of the closeness between complexity classes

✍ Bin Fu 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 669 KB

Lower Bounds for the Complexity of Funct

Lower Bounds for the Complexity of Functions in a Realistic RAM Model

✍ Nader H. Bshouty 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 127 KB

This paper develops a new technique that finds almost tight lower bounds for the complexity of programs that compute or approximate functions in a realistic RAM model. The nonuniform realistic RAM model is a model that uses the arithmetic Ä 4 operations q, y, = , the standard bit operation Shift, Ro