Refutation of Aslam's Proof that NP = P
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
Aslam presents an algorithm he claims will count the number of perfect matchings in any incomplete bipartite graph with an algorithm in the function-computing version of NC, which is itself a subset of FP. Counting perfect matchings is known to be #P-complete; therefore if Aslam's algorithm is correct, then NP=P. However, we show that Aslam's algorithm does not correctly count the number of perfect matchings and offer an incomplete bipartite graph as a concrete counter-example.
13 pages, 2 figures, a response to Aslam's paper (arXiv:0812.1385v11) and the underlying arguments (arXiv:0812.1385v9). Very minor content changes and typos fixed
13 pages, 2 figures, a response to Aslam's paper (arXiv:0812.1385v11) and the underlying arguments (arXiv:0812.1385v9). Very minor content changes and typos fixed