Please use this identifier to cite or link to this item:
https://dspace.iiti.ac.in/handle/123456789/4795
| Title: | Intelligent systems and polynomial solvability of NP-complete problems |
| Authors: | Chaudhari, Narendra S. |
| Keywords: | Algorithmic approach;Analysis of algorithms;Automated theorem proving;Complexity measures;Fundamental problem;NP Complete;NP complete problems;Polynomial algorithm;Polynomial bounds;Simplified analysis;Theory of computation;Algorithms;Computational complexity;Cybernetics;Intelligent systems;Polynomials;Problem solving;Theorem proving |
| Issue Date: | 2010 |
| Citation: | Chaudhari, N. S. (2010). Intelligent systems and polynomial solvability of NP-complete problems. Paper presented at the 2010 IEEE Conference on Cybernetics and Intelligent Systems, CIS 2010, 132-137. doi:10.1109/ICCIS.2010.5518569 |
| 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. © 2010 IEEE. |
| URI: | https://doi.org/10.1109/ICCIS.2010.5518569 https://dspace.iiti.ac.in/handle/123456789/4795 |
| ISBN: | 9781424464999 |
| Type of Material: | Conference Paper |
| Appears in Collections: | Department of Computer Science and Engineering |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
Altmetric Badge: