Errors in Improved Polynomial Algorithm For 3 Sat Proposed By Narendra Chaudhari
Ritesh Vispute
TL;DR
This paper identifies errors in Narendra Chaudhari's polynomial-time algorithm for 3-SAT, providing specific instances where the algorithm fails to produce correct results.
Contribution
It critically analyzes and demonstrates the flaws in an existing polynomial-time 3-SAT algorithm, challenging its claimed correctness.
Findings
The algorithm produces incorrect results on certain instances.
Specific counterexamples are provided to illustrate the errors.
The paper questions the validity of the polynomial-time claim.
Abstract
There are errors in the algorithm proposed by Narendra Chaudhari [2] purporting to solve the 3-sat problem in polynomial time. The present paper present instances for which the algorithm outputs erroneous results.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Advanced Mathematical Theories