Five researchers have posted a major new paper to the Electronic Colloquium on Computational Complexity. The study demonstrates that the bipartite matching problem belongs to the NC complexity class. This theoretical breakthrough indicates that the matching problem can be solved efficiently in parallel.