✦ LIBER ✦

Boolean Circuits, Tensor Ranks, and Communication Complexity

✍ Scribed by Pudlák, Pavel; Rödl, Vojtech; Sgall, Jirí

Book ID: 118177378
Publisher: Society for Industrial and Applied Mathematics
Year: 1997
Tongue: English
Weight: 481 KB
Volume: 26
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539794264809

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity of Boolean algebras and their

Complexity of Boolean algebras and their Scott rank

✍ P. E. Alaev 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 925 KB

Modelling the complexity of parallel and

Modelling the complexity of parallel and VLSI computations with Boolean circuits

✍ Constantinos V. Papadopoulos; Theodoros S. Andronikos 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 706 KB

Matrix rank and communication complexity

✍ Bruno Codenotti; Gianna Del Corso; Giovanni Manzini 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 76 KB

The rank of a matrix seems to play a role in the context of communication complexity, a framework developed to analyze basic communication requirements of computational problems. We present some issues and open problems arising in this area, and put forward a number of research subjects in linear al

Harmonic Analysis, Real Approximation, a

Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions

✍ V. Grolmusz 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 121 KB

Lower bounds on threshold and related ci

Lower bounds on threshold and related circuits via communication complexity

✍ Roychowdhury, V.P.; Orlitsky, A.; Kai-Yeung Siu 📂 Article 📅 1994 🏛 IEEE 🌐 English ⚖ 764 KB

Tensor Norms and the Classical Communica

Tensor Norms and the Classical Communication Complexity of Nonlocal Quantum Measurement

✍ Shi, Yaoyun; Zhu, Yufan 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 202 KB