Yumeng He, Matan Kotler-Berkowitz, Harry Liuson, Zeyu Nie
{"title":"对杜维明《3-SAT 的多项式时间算法》的批判","authors":"Yumeng He, Matan Kotler-Berkowitz, Harry Liuson, Zeyu Nie","doi":"arxiv-2404.04395","DOIUrl":null,"url":null,"abstract":"In this paper, we examine the claims made by the paper \"A polynomial-time\nalgorithm for 3-SAT\" by Lizhi Du. The paper claims to provide a polynomial-time\nalgorithm for solving the NP-complete problem 3-SAT. In examining the paper's\nargument, we find a flaw in one of the main sections of its algorithm. We argue\nthat this flaw causes the paper's algorithm to incorrectly decide that an\ninfinite family of satisfiable 3-CNF boolean formulas are not satisfiable.\nTherefore, the paper does not establish that P = NP.","PeriodicalId":501024,"journal":{"name":"arXiv - CS - Computational Complexity","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Critique of Du's \\\"A Polynomial-Time Algorithm for 3-SAT\",\"authors\":\"Yumeng He, Matan Kotler-Berkowitz, Harry Liuson, Zeyu Nie\",\"doi\":\"arxiv-2404.04395\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we examine the claims made by the paper \\\"A polynomial-time\\nalgorithm for 3-SAT\\\" by Lizhi Du. The paper claims to provide a polynomial-time\\nalgorithm for solving the NP-complete problem 3-SAT. In examining the paper's\\nargument, we find a flaw in one of the main sections of its algorithm. We argue\\nthat this flaw causes the paper's algorithm to incorrectly decide that an\\ninfinite family of satisfiable 3-CNF boolean formulas are not satisfiable.\\nTherefore, the paper does not establish that P = NP.\",\"PeriodicalId\":501024,\"journal\":{\"name\":\"arXiv - CS - Computational Complexity\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-04-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Computational Complexity\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2404.04395\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Computational Complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2404.04395","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
在本文中，我们对杜立志的论文 "A polynomial-timealgorithm for 3-SAT "所提出的主张进行了研究。该论文声称提供了一种多项式时间算法来求解 NP-完全问题 3-SAT。在研究该论文的论证过程中，我们发现其算法的一个主要部分存在缺陷。我们认为，这个缺陷导致论文的算法错误地判定可满足的 3-CNF 布尔型公式的无限族不可满足。
A Critique of Du's "A Polynomial-Time Algorithm for 3-SAT
In this paper, we examine the claims made by the paper "A polynomial-time
algorithm for 3-SAT" by Lizhi Du. The paper claims to provide a polynomial-time
algorithm for solving the NP-complete problem 3-SAT. In examining the paper's
argument, we find a flaw in one of the main sections of its algorithm. We argue
that this flaw causes the paper's algorithm to incorrectly decide that an
infinite family of satisfiable 3-CNF boolean formulas are not satisfiable.
Therefore, the paper does not establish that P = NP.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
