𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Interpolation of the Discrete Logarithm in Finite Fields by Boolean Functions

✍ Scribed by Tanja Lange; Arne Winterhof


Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
525 KB
Volume
6
Category
Article
ISSN
1571-0653

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