Simulating (log/sup c/n)-wise independence in NC

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...

Full description

Saved in:
Bibliographic Details
Published in30th Annual Symposium on Foundations of Computer Science pp. 2 - 7
Main Authors Berger, B., Rompel, J.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1989
Subjects
Lattices
Out of order
Polynomials
Random variables
Online AccessGet full text

Cover

More Information
Summary: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.< >
ISBN:9780818619823
0818619821
DOI:10.1109/SFCS.1989.63447