Response to Refutation of Aslam's Proof that NP = P

Abstract

This paper provides a further refinement to the previous response by introducing new structures and algorithms for counting VMPs of common \emph{Edge Requirement} (ER) and hence for counting the perfect matchings.

arXiv commentTotal 9 pages, including the figures. Have further minimized the overlap, with only references to the main paper

References in corpus (2)

• Refutation of Aslam's Proof that NP = P
• An Extension of the Permutation Group Enumeration Technique (Collapse of the Polynomial Hierarchy: $\mathbf{NP}=\mathbf{P}$)