On Fri, Mar 27, 2015 at 5:24 PM, Jim Bromer <[email protected]> wrote: > On Thu, Mar 26, 2015 at 10:40 PM, Matt Mahoney <[email protected]> > wrote: >> You are aware that a solution to any one of the over 3000 known >> NP-complete problems will solve all of them, right? What I find >> amazing is that you didn't know this after all the years you have been >> working on the problem. >> -- Matt Mahoney, [email protected] > > I am not certain that is true, regardless of your opinion.
It is true by definition. http://en.wikipedia.org/wiki/NP-complete#Formal_definition_of_NP-completeness Anyway, I thought it might save you some effort. Maybe a problem like subset-sum or traveling salesman or subgraph isomorphism might seem easier than 3-SAT and you could solve it that way. -- -- Matt Mahoney, [email protected] ------------------------------------------- AGI Archives: https://www.listbox.com/member/archive/303/=now RSS Feed: https://www.listbox.com/member/archive/rss/303/21088071-f452e424 Modify Your Subscription: https://www.listbox.com/member/?member_id=21088071&id_secret=21088071-58d57657 Powered by Listbox: http://www.listbox.com
