Bipartite Matching Is in NC
bipartite matchingcomplexity class NCparallel algorithmsderandomizationtheoretical computer science
Author: amichail
Date: 6/22/2026
Article Summary:
A blog post discussing a new paper that shows the Bipartite Matching problem is in the complexity class NC, and its implications for parallel algorithms and derandomization.