Re:The Boolean Satisfiability Problem and SAT Solvers
by DerekL on Thursday June 08, 2017 @03:30AM
(#14512558)
No, the article is correct. Wikipedia says, “A problem p in NP is NP-complete if every other problem in NP can be transformed (or reduced) into p in polynomial time.” They cite the paper “The complexity of theorem-proving procedures”, Stephen A. Cook (1971), which says:
https://en.wikipedia.org/wiki/NP-completeness
http://dl.acm.org/citation.cfm?coll=GUIDE&dl=GUIDE&id=805047
[ Parent
| on HN ]
There are no comments on this comment yet.