2011/12/12 by Ritesh Vispute, Vispute, Ritesh
Computer Science · Engineering · Mathematics · #Advanced Combinatorial Mathematics #Advanced Mathematical Theories #Coding theory and cryptography #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Polynomial and algebraic computation #cs.CC #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1112.2519
arxiv created 2011/12/12 · openalex publication_date 2011/12/12 · arxiv updated 2011/12/13 · openalex created_date 2022/09/01 · openalex updated_date 2026/07/28
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.