𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the construction of parallel computers from various bases of boolean functions

✍ Scribed by Leslie M. Goldschlager; Ian Parberry

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
883 KB
Volume
43
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Computing Walsh Transform from the Algeb
Computing Walsh Transform from the Algebraic Normal Form of a Boolean Function
✍ Kishan Chand Gupta; Palash Sarkar πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 355 KB

We study the relationship between the Walsh transform and the algebraic normal form of a Boolean function. In the first part of the paper, we carry out a combinatorial analysis to obtain a formula for the Walsh transform at a certain point in terms of parameters derived from the algebraic normal for

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