On deterministic approximation of DNF

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F130073, Issue , 1991, Pages 430-438

  Luby, Michael ^a   Velitković, Boban ^b  

^a INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^b MATHEMATICAL SCIENCES RESEARCH INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DETERMINISTIC ALGORITHMS; DETERMINISTIC APPROXIMATION; DISJUNCTIVE NORMAL FORM FORMULAS; TRUTH ASSIGNMENT;

COMPUTATION THEORY;

EID: 77955175993     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/103418.103464     Document Type: Conference Paper

References (18)

1. Alon, N., Goidreich, 0., Hhstad, J., Peralta, R., "Simple constructions of almost kwise independent random variables", FOGS 90
2. Ajtai, M., "-Formulae on Finite Structures", Annals of Pure and Applied Logic, 24, 1983, pp. 1-48
3. Ajtai, M., Wigderson, A., "Deterministic Simulation of Probabilistic constant depth circuits", FOGS 85
4. Alon, N, , L. Babai, A. Itai, "A Fast and Simple Randomized Parallel Algorithm for the Ma, ximal Independent Set Problem", Journal of Algorithms, 7, pp. 567-583, 1986
5. Erdös, P., Rado, R, "Intersection theorems for systems of sets", Journal of the London Math. Society, vol.35, pp.85-90
6. Furst, M., Saxe, J., Sipser, M., "Parity, Circuits and the Polynomial Time Hierarchy", FOGS 81
7. Hástad, J., "Computational limitations for small depth circuits", Ph.D. Thesis, M.I.T. press, 1986
8. Karp, R., Luby, M., "Monte-Carlo algorithms for enumeration and reliability problems", STOG 83
9. Karp., R., Luby, M., Madras, N., "Monte-Carlo Approximation Algorithms for Enumeration Problems, " J. of Algorithms, Vol. 10, No. 3, Sept. 1989, pp. 429-448
10. Linial, N., Nisan, N., "Approximate Inclusion-Exclusion", STOC 90
11. Luby, M., "A Simple Parallel Algorithm for the Maximal Independent Set Problem", STOG 85, pp. 1-10
12. SIAM J. Computing, Vol. 15, No. 4, November 1986, pp. 1036-1053
13. Naor, M., Naor, S., "Small Bias Probability Spaces: Efficient Constructions and Applications", STOG 90
14. Nisan, N., Wigderson, A., "Hardness vs. Randomness", FOGS 89, pp. 2-11
15. Valiant, L. G., "The complexity of computing the permanent", Theoretical Computer Science, 1979, No. 8, pp 189-201
16. Vazirani, U., "Randomness, adversaries and computation", Ph.D. Thesis, UC Berkeley, 1986
17. Weil, A., "Sur les courbes algébriques et les vaijétés qui sen cléduisent", Actualues 5c2. md. No. 104k, 1948
18. Yao, A., "Separating the Polynomial-Time Hierarchy by Oracles", FOGS 85, pp. 1-10