Title :
Simulating (logcn)-wise independence in NC
Author :
Berger, Bonnie ; Rompel, John
Author_Institution :
MIT Lab. for Comput. Sci., Cambridge, MA, USA
fDate :
30 Oct-1 Nov 1989
Abstract :
A general framework is developed for removing randomness from randomized NC algorithms whose analysis uses only polylogarithmic independence. Previously, no techniques were known to determinize those RNC algorithms depending on more than constant independence. One application of the techniques is an NC algorithm for the set discrepancy problem, which can be used to obtain many other NC algorithms, including a better NC edge-coloring algorithm. As another application an NC algorithm for the hypergraph coloring problem is provided
Keywords :
computational complexity; graph colouring; (logcn)-wise independence; NC edge-coloring algorithm; RNC algorithms; hypergraph coloring problem; polylogarithmic independence; randomized NC algorithms; randomness removal; set discrepancy problem; simulation; Lattices; Out of order; Polynomials; Random variables;
Conference_Titel :
Foundations of Computer Science, 1989., 30th Annual Symposium on
Conference_Location :
Research Triangle Park, NC
Print_ISBN :
0-8186-1982-1
DOI :
10.1109/SFCS.1989.63447
