𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Complexity of Computation of Partial Derivatives of Boolean Functions Realized by Zhegalkin Polynomials

✍ Scribed by A.N. Alekseichuk


Book ID
110325360
Publisher
Springer US
Year
2001
Tongue
English
Weight
49 KB
Volume
37
Category
Article
ISSN
1573-8337

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