Delete comment from: Computational Complexity
@Anon #11: While Scott unfortunately did not state his reasons in his first post on the subject (though he did elaborate on them in his subsequent posts), Lance did give a hint as to where the trouble may lie (see his tweet on the subject which refers to a particular point in Lipton's first post on the subject, specifically the sentence "He then argues if P=NP, then by the above theorem it must follow that SAT has certain structural properties."
Aug 16, 2010, 3:59:35 PM
Posted to But This One Is Different...