Response to Refutation of Aslam's Proof that NP = P
Computational Complexity
2017-10-10 v4
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.
Cite
@article{arxiv.0906.5112,
title = {Response to Refutation of Aslam's Proof that NP = P},
author = {Javaid Aslam},
journal= {arXiv preprint arXiv:0906.5112},
year = {2017}
}
Comments
Total 9 pages, including the figures. Have further minimized the overlap, with only references to the main paper