Bipartite Perfect matching in Pseudo-deterministic NC
Date: Wednesday, September 21, 2016
Time: 4:00 PM to 5:00 PM Note: all times are in the Eastern Time Zone
Host: Pritish Kamath and Akshay Degwekar
Contact: Rebecca Yadegar, firstname.lastname@example.org
Speaker URL: None
TALK: Ofer Grossman: Bipartite Perfect matching in Pseudo-deterministic NC
Abstract: Pseudo-deterministic algorithms are randomized search algorithms that on different executions on the same input, output the same solution with high probability.
We will discuss how pseudo-deterministic algorithms bridge the gap between randomized search and decision problems for problems in P and in NC. Next, we will show a pseudo-deterministic NC algorithm for bipartite matching. Finally, we will show how pseudo-determinism can be used to save on random bits used by classical randomized algorithms.
Joint work with Shafi Goldwasser.
Created by Rebecca Yadegar at Monday, September 12, 2016 at 2:01 PM.