Optimal bounds for the approximation of boolean functions and some applications

Theoretical Computer Science

Volumn 180, Issue 1-2, 1997, Pages 243-268

  Andreev, Alexander E ^a   Clementi, Andrea E F ^b   Rolim, José D P ^c  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c UNIVERSITY OF GENEVA   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; LOGIC CIRCUITS; MATHEMATICAL OPERATORS; OPTIMIZATION;

CIRCUIT SIZE COMPLEXITY; HARDNESS FUNCTION; SHANNON FUNCTION;

BOOLEAN FUNCTIONS;

EID: 0346047434     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00217-4     Document Type: Article

References (28)

1. E. Allender and M. Strauss, Measure on small complexity classes, with applications for BPP, in: Proc. 35th IEEE-FOCS (1994) 807-818.
2. N. Alon and J.H. Spencer, The Probabilistic Method (Wiley-Interscience, New York, 1992).
3. A.E. Andreev, (1985), The universal principle of self-correction, Mat. Sbornik 127 (169) (6) 147-172 (in Russian); an English translation appears in: Math. USSR Sbornik 55 (1) (1986) 145-169.
4. A.E. Andreev, (1985), The universal principle of self-correction, Mat. Sbornik 127 (169) (6) 147-172 (in Russian); an English translation appears in: Math. USSR Sbornik 55 (1) (1986) 145-169.
5. A.E. Andreev, On the complexity of the realization of partial Boolean functions by circuits of functional elements, Diskret. Mat. 1 (1989) 36-45 (in Russian); an English translation appears in: J. Discrete Math. Appl. 1 (1989) 251-262.
6. A.E. Andreev, On the complexity of the realization of partial Boolean functions by circuits of functional elements, Diskret. Mat. 1 (1989) 36-45 (in Russian); an English translation appears in: J. Discrete Math. Appl. 1 (1989) 251-262.
7. A. Andreev, A. Clementi and J. Rolim, Optimal bounds for the approximation of boolean functions and some applications (extended abstract), in: Proc. XIII Annual Symp. on Theoretical Aspects of Computer Science (STACS'96), Lecture Notes in Computer Science, Vol. 1046 (Springer, Berlin, 1996) 319-330.
8. M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudorandom bits, J. SIAM, 13 (4) (1984) 850-864.
9. R.B. Boppana and Y. Hirshfield, Pseudorandom generators and complexity classes, in: S. Micali ed., Randomness and Computation, Adv. in Comput. Res., Vol. 5 (JAI Press, London, 1989) 1-26.
10. R.B. Boppana and M. Sipser, The complexity of finite boolean functions, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. A, Ch. 14 (Elsevier, Amsterdam, 1990) 759-804.
11. J. Cai, K.W. Regan and D. Sivakumar, Pseudorandom generators, measure theory, and natural proofs, in: Proc. the 36th IEEE- FOCS (1995).
12. H. Chernoff, A measure of asymptotic efficiency for tests of a hypothesis on the sum of observations, Ann. Math. Statist. 23, (1952) 493-507.
13. W. Feller, An Introduction to Probability Theory and its Applications, Vol. I (Wiley, New York, 2nd ed., 1970).
14. T. Hagerup and C. Rub, A guided tour of Chernoff bounds, IPL 33 (1990) 305-308.
15. M. Kearns and U. Vazirani, Topics in Computational Learning Theory (MIT Press, Cambridge, MA, 1994).
16. O.B. Lupanov, About gating and contact-gating circuits, Dokl. Akad. Nauk SSSR 111 (1956) 1171-11744.
17. O.B. Lupanov, About a method circuits design -local coding principle, Problemy Kibernet. 10 (1965) 31-110 (in Russian).
18. D.M. Mueller, Complexity in electronic switching circuits, IRE Trans. Electron Comput. 5 (1956) 15-19.
19. E.I. Nechiporuk, About the complexity of gating circuits for the partial boolean matrix, Dokl. Akad. Nauk SSSR 163 (1965) 40-42.
20. N. Nisan, Using Hard Problems to Create Pseudorandom Generators, ACM Distinguished Dissertation (MIT Press, Cambridge, MA, 1992).
21. N. Nisan and A. Wigderson, Hardness vs. randomness, J. Comput. System Sci. 49 (1994) 149-167 (presented also at the 29th IEEE FOCS, 1988).
22. N. Nisan and A. Wigderson, Hardness vs. randomness, J. Comput. System Sci. 49 (1994) 149-167 (presented also at the 29th IEEE FOCS, 1988).
23. N. Pippenger, Information theory and the complexity of Boolean functions, Math. Systems Theory 10 (1977) 129-167.
24. A. Razborov and S. Rudich, Natural proofs, in: Proc. 26th ACM-STOC (1994) 204-213.
25. C.E. Shannon, The synthesis of two-terminal switching circuits, Bell. Syst. Tech. J. 28 (1949) 59-98.
26. L.A. Sholomov, About realization of partial boolean functions by circuits from functional elements, Problemy Kibernet. 21 (1969) 215-226.
27. I. Wegener, The complexity of Finite Boolean Functions, Wiley-Teubner Series in Computer Science (Teuber, Stuttgart/Wiley, Chichester/1987).
28. A.C. Yao, Theory and applications of trapdoor functions, in: Proc. 23th IEEE-FOGS (1982) 80-91.