An Extension of the Permutation Group Enumeration Technique (Collapse of the Polynomial Hierarchy: $\mathbf{NP}=\mathbf{P}$)

Javaid Aslam

The distinguishing result of this paper is a $\mathbf{P}$-time enumerable partition of all the potential perfect matchings in a bipartite graph. This partition is a set of equivale…