parallel-MIS

1 page tagged.

Computer science / Coursework / Randomized algorithms Lecture 8: Derandomization Removing randomness while keeping the speed: enumeration, non-uniform advice, conditional probabilities with pessimistic estimators, k-wise independence, and PRGs (Nisan–Wigderson).