Coming from Hall's Theorem that for there to be a matching, $|N(S)| \ge |S|$, it seems very difficult to check if there is a matching in a bipartite graph if the set grows quite large.
Rather than checking by hand to see if each subset of the set has a matching, is there an easier way to compute this?
Thanks!