On Deterministic Approximation of DNF

Algorithmica (New York)

Volumn 16, Issue 4-5, 1996, Pages 415-433

  Luby, M ^a,b   Velickovic B ^c,d  

^a INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITÉ PARIS DESCARTES   (France)

^d CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

P complete; Approximation algorithms; Derandomization; DNF formula; Small sample spaces

Indexed keywords

EID: 1542710520     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf01940873     Document Type: Article

References (23)

1. 1-Formulae on Finite Structures, Annals of Pure and Applied Logic, Vol. 24, 1983, pp. 1-48.
2. Ajtai, M., Wigderson, A., Deterministic Simulation of Probabilistic Constant Depth Circuits, Proceedings of the 26th Annual Symposium on the Foundations of Computer Science, Portland, Oregon, 1985, pp. 11-19.
3. Alon, N., Babai, L., Itai, A., A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem, Journal of Algorithms, Vol. 7, 1986, pp. 567-583.
4. Alon, N., Goldreich, O., Håstad, J., Peralta, R., Simple Constructions of Almost k-Wise Independent Random Variables, Proceedings of the 31st Annual Symposium on the Foundations of Computer Science, St. Louis, Missouri, 1990, pp. 544-553.
5. Boppana, R., Hirschfeld, R., Pseudo-Random Generators and Complexity Classes, in S. Micali, ed., Advances in Computer Research, Vol. 5, JAI Press, Greenwich, CT, 1989, pp. 1-26.
6. Erdös, P., Rado, R, Intersection Theorems for Systems of Sets, Journal of the London Mathematical Society, Vol. 35, pp. 85-90.
7. Even, G., Goldreich, O., Luby, M., Nisan, N., Veličković, B., Approximations of General Independent Distributions, Proceedings of the 24th Annual Symposium on the Theory of Computing, Victoria, British Columbia, 1992, pp. 10-16.
8. Furst, M., Saxe, J., Sipser, M., Parity, Circuits and the Polynomial Time Hierarchy, Proceedings of the 22nd Annual Symposium on the Foundations of Computer Science, 1981, pp. 260-270.
9. Håstad, J., Computational Limitations for Small Depth Circuits, Ph.D. thesis, M.I.T., 1986.
10. Karp, R., Luby, M., Monte-Carlo Algorithms for Enumeration and Reliability Problems, Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, 1983, pp. 54-63.
11. Karp, R., Luby, M., Madras, N., Monte-Carlo Approximation Algorithms for Enumeration Problems, Journal of Algorithms, Vol. 10, No. 3, 1989, pp. 429-448.
12. Linial, N., Nisan, N., Approximate Inclusion-Exclusion, Combinatorica, Vol. 10, No. 4, 1990, pp. 349-365.
13. Luby, M., A Simple Parallel Algorithm for the Maximal Independent Set Problem, Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, 1985, pp. 1-10, also in SIAM Journal on Computing, Vol. 15, No. 4, 1986, pp. 1036-1053.
14. Luby, M., A Simple Parallel Algorithm for the Maximal Independent Set Problem, Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, 1985, pp. 1-10, also in SIAM Journal on Computing, Vol. 15, No. 4, 1986, pp. 1036-1053.
15. Luby, M., Veličković, B., Wigderson, A., Deterministic Approximate Counting of Depth-2 Circuits, Proceedings of the Second Israeli Symposium on Theory of Computing and Systems, 1993.
16. Naor, M., Naor, S., Small Bias Probability Spaces: Efficient Constructions and Applications, Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, Baltimore, Maryland, 1990, pp. 213-223.
17. Nisan, N., Wigderson, A., Hardness vs. Randomness, Proceedings of the 29th Annual Symposium on the Foundations of Computer Science, White Plains, New York, 1988, pp. 2-11.
18. Razborov, A., Lower Bounds on the Monotone Complexity of Some Boolean Functions, Doklady Akademii Nauk SSSR, Vol. 281, No. 4, 1985, pp. 798-801 (in Russian). English translation in Soviet Mathematics Doklady, Vol. 31, pp. 354-357.
19. Razborov, A., Lower Bounds on the Monotone Complexity of Some Boolean Functions, Doklady Akademii Nauk SSSR, Vol. 281, No. 4, 1985, pp. 798-801 (in Russian). English translation in Soviet Mathematics Doklady, Vol. 31, pp. 354-357.
20. Valiant, L. G., The Complexity of Computing the Permanent, Theoretical Computer Science, No. 8, 1979, pp. 189-201.
21. Vazirani, U., Randomness, Adversaries and Computation, Ph.D. thesis. University of California, Berkeley, 1986.
22. Weil, A., Sur les courbes algébriques et les variétés qui s'en déduisent, Actualités Scientifiques et Industrielles, No. 1041, Hermann, Paris, 1948.
23. Yao, A., Separating the Polynomial-Time Hierarchy by Oracles, Proceedings of the 26th Annual Symposium on the Foundations of Computer Science, Portland, Oregon, 1985, pp. 1-10.