Optimal bounds for the approximation of Boolean functions and some applications
From MaRDI portal
Publication:1390872
DOI10.1016/S0304-3975(96)00217-4zbMath0911.94010MaRDI QIDQ1390872
Andrea E. F. Clementi, José D. P. Rolim, Alexander E. Andreev
Publication date: 22 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- A guided tour of Chernoff bounds
- Hardness vs randomness
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- On the complexity of realization of partial Boolean functions by circuits of functional elements
- A UNIVERSAL PRINCIPLE OF SELF-CORRECTION
- Information theory and the complexity of boolean functions
- Optimal bounds on the approximation of boolean functions with consequences on the concept of hardness
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Natural proofs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Optimal bounds for the approximation of Boolean functions and some applications
