𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Linear lower bounds on unbounded fan-in boolean circuits

✍ Scribed by Juraj Hromkovič

Book ID
113162763
Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
317 KB
Volume
21
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Computation of Boolean Functions
On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In
✍ György Turán; Farrokh Vatan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 741 KB

We consider the complexity of computing Boolean functions by analog circuits of bounded fan-in, i.e., by circuits of gates computing real-valued functions, either exactly or as sign-representation. Sharp upper bounds are obtained for the complexity of the most difficult n-variable function over cert

A linear lower bound on the unbounded er
A linear lower bound on the unbounded error probabilistic communication complexity
✍ Jürgen Forster 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 187 KB

The main mathematical result of this paper may be stated as follows: Given a matrix MAfÀ1; 1g nÂn and any matrix MAR nÂn such that signð Mi;j Þ ¼ M i;j for all i; j; then rankð MÞXn=jjMjj: Here jjMjj denotes the spectral norm of the matrix M: This implies a general lower bound on the complexity of