{"title":"智能系统与np完全问题的多项式可解性","authors":"N. Chaudhari","doi":"10.1109/ICCIS.2010.5518569","DOIUrl":null,"url":null,"abstract":"Many fundamental problems in automated theorem proving are known to be NP-Complete. In [4], we have given a polynomial algorithm for 3-SAT, one of the first NP-Complete problems. The result is unexpected and has deep consequences for the design of intelligent systems; hence, in this paper, we review our algorithmic approach for 3-SAT, and we give simplified analysis of our approach to demonstrate the polynomial bound of O(n13) operations. We also indicate the immediate and important consequences of our polynomial algorithm for 3-SAT for the design of intelligent systems.","PeriodicalId":445473,"journal":{"name":"2010 IEEE Conference on Cybernetics and Intelligent Systems","volume":"329 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Intelligent systems and polynomial solvability of NP-complete problems\",\"authors\":\"N. Chaudhari\",\"doi\":\"10.1109/ICCIS.2010.5518569\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many fundamental problems in automated theorem proving are known to be NP-Complete. In [4], we have given a polynomial algorithm for 3-SAT, one of the first NP-Complete problems. The result is unexpected and has deep consequences for the design of intelligent systems; hence, in this paper, we review our algorithmic approach for 3-SAT, and we give simplified analysis of our approach to demonstrate the polynomial bound of O(n13) operations. We also indicate the immediate and important consequences of our polynomial algorithm for 3-SAT for the design of intelligent systems.\",\"PeriodicalId\":445473,\"journal\":{\"name\":\"2010 IEEE Conference on Cybernetics and Intelligent Systems\",\"volume\":\"329 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Conference on Cybernetics and Intelligent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCIS.2010.5518569\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Conference on Cybernetics and Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIS.2010.5518569","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Intelligent systems and polynomial solvability of NP-complete problems
Many fundamental problems in automated theorem proving are known to be NP-Complete. In [4], we have given a polynomial algorithm for 3-SAT, one of the first NP-Complete problems. The result is unexpected and has deep consequences for the design of intelligent systems; hence, in this paper, we review our algorithmic approach for 3-SAT, and we give simplified analysis of our approach to demonstrate the polynomial bound of O(n13) operations. We also indicate the immediate and important consequences of our polynomial algorithm for 3-SAT for the design of intelligent systems.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
