Constructing small sample spaces satisfying given constraints

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129585, Issue , 1993, Pages 268-277

  Koller, Daphne ^a   Lvlegiddo, Nimrod ^b  

^a STANFORD UNIVERSITY   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; GRAPH THEORY; POLYNOMIAL APPROXIMATION; RANDOM VARIABLES; ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBABILISTIC LOGICS; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

CARDINALITIES; DISCRETE RANDOM VARIABLES; INDEPENDENT RANDOM VARIABLES; INDEPENDENT SET; JOINT DISTRIBUTIONS; POLYNOMIAL-TIME; SAMPLE SPACE; SMALL SAMPLES;

CONSTRAINT SATISFACTION PROBLEMS; CONSTRAINT THEORY;

INDEPENDENCE CONSTRAINTS; SPARSE HYPERGRAPHS;

EID: 0027274447     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/167088.167168     Document Type: Conference Paper

References (15)

1. N. Alon, L. Babai, and A. Itai, "A fast and simple randomized parallel algorithm for the maximal independent set problem, " Journal of Algorithms, 7 (1986) 567-583.
2. L. Adleman, "Two theorems on random polynomial time, " in: Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Angeles, 1978, pp. 75-83.
3. N. Alon, O. Goldreich, J. Hastad, and R. Per-Alta, "Simple constructions of almost &-wise independent random variables, " in: Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Angeles, 1990, pp. 544-553.
4. N. Alon, Private communication.
5. Y. Azar, R. Motwani, and J. Naor. "Approximating arbitrary probability distributions using small sample spaces, " unpublished manuscript.
6. B. Berger and J. Rompel. "Simulating (logcn)-wise independence in NC, " in: Pro-ceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Angeles, 1989, pp. 2-7.
7. B. Chor, O. Goldreich, J. Hastad, J. Friedman, S. Rudich, and R. Smolensky, "t- resilient functions, " in: Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, IEEE! Computer Society Press, Los Angeles, 1985, pp. 396407, 1985.
8. G. Even, O. Goldreich, M. Luby, N. Nisan, and B. Velickovi'c, "Approximations of gen-eral independent distributions, " in: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, ACM, New York, 1992, pp. 10-16.
9. A. Joffe, "On a set of almost deterministic κ-independent random variables, " Annals of Probability 2 (1974) 161-162.
10. M. Luby, "A simple parallel algorithm for the maximal independent set problem, " SIAM Journal on Computing 15 (1986) 10361053.
11. R. Motwani, J. Naor, and M. Naor, "The probabilistic method yields deterministic par-Allel algorithms, " in: Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Angeles, 1989, pp. 8-13.
12. J. Naor and M. Naor, "Small-bias probability spaces: Efficient constructions and appli-cations, in: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, ACM, New York, 1990, pp. 213-223.
13. P. Raghavan, "Probabilistic construction of deterministic algorithms: Approximating packing integer problems, " J. Comp. Sys. Sci., 37 (1988) 130-143.
14. L. J. Schulman, "Sample spaces uniform on neighborhoods, " in: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, ACM, (1992) pp. 17-25.
15. J. Spencer, Ten Lectures on the Probabilistic Method, Society for Industrial and Applied Mathematics, 1987.