tag:blogger.com,1999:blog-3722233.post90210093..comments2017-04-28T10:57:44.459-04:00Comments on Computational Complexity: Foundations of Complexity Lesson 14: CNF-SAT is NP-completeLance Fortnowhttps://plus.google.com/101693130490639305932noreply@blogger.comBlogger1125tag:blogger.com,1999:blog-3722233.post-23108415483910974702011-10-04T23:49:24.934-04:002011-10-04T23:49:24.934-04:00I sincerly apologize for this intrusion. However, ...I sincerly apologize for this intrusion. However, I would like to make a proposition. I developed and implemented a (fairly simple) algorithm that solves any CNF-SAT formula in polynomial time. I know, you think I am a "nut". However, the paper is only 4 pages and would require a minimal amount of effort to read. I would simply like for you to consider posting it on your blog for review. (I will also note that I have only posted this offer on this site.) Of course, you can review the paper first. I am absolutely not asking you to proofread it or test it. I know it works and I spent a considerable amount of time proofreading the paper and making it readable. Since the $1 million is always "looming" in the background, I will also mention that if the paper did end up receiving the price, it would be shared.<br /><br />Thank you,<br />Jason Steinmetz<br />Astoria, NYJasonnoreply@blogger.com