𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the construction of communication networks satisfying bounded fan-in of service ports

✍ Scribed by West, D.B.; Banerjee, P.


Book ID
119772046
Publisher
IEEE
Year
1988
Tongue
English
Weight
644 KB
Volume
37
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On the Computation of Boolean Functions
✍ 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