Tag
A paper by Chatterjee, Ghosh, Gurjar, Raj, and Thierauf claims to show that the Bipartite Matching problem is in the complexity class NC, resolving a central open problem from the 1980s in parallel algorithms and derandomization.