𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On computing reliability-measures of Boolean circuits

✍ Scribed by Chakravarty, S.; Hunt, H.B., III

Book ID
114554999
Publisher
IEEE
Year
1991
Tongue
English
Weight
988 KB
Volume
40
Category
Article
ISSN
0018-9529

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Design of Reliable Boolean Circui
On the Design of Reliable Boolean Circuits That Contain Partially Unreliable Gates
✍ Dan Kleitman; Tom Leighton; Yuan Ma πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 392 KB

We investigate a model of gate failure for Boolean circuits in which a faulty gate is restricted to output one of its input values. For some types of gates, the model, which we call the short-circuit model of gate failure, is weaker than the traditional von Neumann model in which faulty gates always

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