Derandomizing Algorithms via Spectral Graph Theory
Speaker: Salil Vadhan (Harvard) Title: Derandomizing Algorithms via Spectral Graph Theory Abstract: Randomization is a powerful tool for algorithms; it is often easier to design efficient algorithms if we allow the algorithms to "toss coins" and output a correct answer with high probability. However, a longstanding conjecture in theoretical computer science is that every randomized algorithm can be efficiently "derandomized" […]