1. IDR@IIT Indore
  2. IITI Scholarly Publications
  3. Department of Computer Science and Engineering
Please use this identifier to cite or link to this item: https://dspace.iiti.ac.in/handle/123456789/4795
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChaudhari, Narendra S.en_US
dc.date.accessioned2022-03-17T01:00:00Z-
dc.date.accessioned2022-03-17T15:35:31Z-
dc.date.available2022-03-17T01:00:00Z-
dc.date.available2022-03-17T15:35:31Z-
dc.date.issued2010-
dc.identifier.citationChaudhari, 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.5518569en_US
dc.identifier.isbn9781424464999-
dc.identifier.otherEID(2-s2.0-77956087088)-
dc.identifier.urihttps://doi.org/10.1109/ICCIS.2010.5518569-
dc.identifier.urihttps://dspace.iiti.ac.in/handle/123456789/4795-
dc.description.abstractMany 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.en_US
dc.language.isoenen_US
dc.source2010 IEEE Conference on Cybernetics and Intelligent Systems, CIS 2010en_US
dc.subjectAlgorithmic approachen_US
dc.subjectAnalysis of algorithmsen_US
dc.subjectAutomated theorem provingen_US
dc.subjectComplexity measuresen_US
dc.subjectFundamental problemen_US
dc.subjectNP Completeen_US
dc.subjectNP complete problemsen_US
dc.subjectPolynomial algorithmen_US
dc.subjectPolynomial boundsen_US
dc.subjectSimplified analysisen_US
dc.subjectTheory of computationen_US
dc.subjectAlgorithmsen_US
dc.subjectComputational complexityen_US
dc.subjectCyberneticsen_US
dc.subjectIntelligent systemsen_US
dc.subjectPolynomialsen_US
dc.subjectProblem solvingen_US
dc.subjectTheorem provingen_US
dc.titleIntelligent systems and polynomial solvability of NP-complete problemsen_US
dc.typeConference Paperen_US
Appears in Collections:Department of Computer Science and Engineering

Files in This Item:
There are no files associated with this item.
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Altmetric Badge: