✦ LIBER ✦

A Gödel Theorem on Network Complexity Lower Bounds

✍ Scribed by C. P. Schnorr

Publisher: John Wiley and Sons
Year: 1986
Tongue: English
Weight: 550 KB
Volume: 32
Category: Article
ISSN: 0044-3050
DOI: 10.1002/malq.19860321912

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

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

A 3n-lower bound on the network complexi

A 3n-lower bound on the network complexity of Boolean functions

✍ C.P. Schnorr 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 972 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

Sparse matrix vector multiplication on d

Sparse matrix vector multiplication on distributed architectures: Lower bounds and average complexity results

✍ Giovanni Manzini 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 766 KB

Lower variance bounds and a new proof of

Lower variance bounds and a new proof of the central limit theorem

✍ T Cacoullos; V Papathanasiou 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 428 KB