A parallel algorithmic version of the local lemma

The Lovasz local lemma (1975) is a tool that enables one to show that certain events hold with positive, though very small probability. It often yields existence proofs of results without supplying any efficient way of solving the corresponding algorithmic problems. J. Beck has recently found a method for converting some of these existence proofs into efficient algorithmic procedures, at the cost of losing a little in the estimates, but his method does not seem to be parallelizable. His technique is modified to achieve an algorithmic version that can be parallelized, thus providing deterministic NC/sup 1/ algorithms for various interesting algorithmic search problems.<<ETX>>

[1]  Bonnie Berger,et al.  Simulating (logcn)-wise independence in NC , 1991, JACM.

[2]  Noga Alon,et al.  Cycles of length 0 modulo k in directed graphs , 1989, J. Comb. Theory, Ser. B.

[3]  József Beck,et al.  An Algorithmic Approach to the Lovász Local Lemma. I , 1991, Random Struct. Algorithms.

[4]  N. Alon.  The linear arboricity of graphs , 1988 .

[5]  Noga Alon,et al.  A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.

[6]  Shmuel Friedland,et al.  Every 7-regular digraph contains an even cycle , 1989, J. Comb. Theory, Ser. B.

[7]  Bruce A. Reed,et al.  Acyclic Coloring of Graphs , 1991, Random Struct. Algorithms.

[8]  Bonnie Berger,et al.  Simulating (log/sup c/n)-wise independence in NC , 1989, 30th Annual Symposium on Foundations of Computer Science.

[9]  Noga Alon.  The String Chromatic Number of a Graph , 1992, Random Struct. Algorithms.

[10]  Noga Alon,et al.  Simple construction of almost k-wise independent random variables , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[11]  Noga Alon,et al.  On the complexity of radio communication , 1989, STOC '89.

[12]  J. Spencer.  Ten lectures on the probabilistic method , 1987 .

[13]  C. Thomassen.  Sign-Nonsingular Matrices and Even Cycles in Directed Graphs , 1986 .

[14]  John E. Hopcroft,et al.  The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..

[15]  Noga Alon,et al.  Single Round Simulation on Radio Networks , 1992, J. Algorithms.

[16]  Richard M. Karp,et al.  Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[17]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[18]  Noga Alon,et al.  The star arboricity of graphs , 1988, Discret. Math..

[19]  P. Erdös.  Problems and Results on Finite and Infinite Graphs , 1975 .