3-SAT in polynomial time, or P=NP

Posted by MartinodF on Tuesday October 11, 2011 @07:13AM
from the arxiv.org dept.

http://arxiv.org/abs/1110.1658

( 3 comments | 5 points | on HN )

Re:3-SAT in polynomial time, or P=NP by s2r2 on Tuesday October 11, 2011 @07:28AM (#3098135)

http://news.ycombinator.com/item?id=3097684

...same entry, [deleted] but with a little discussion.

[ Parent | on HN ]

Re:3-SAT in polynomial time, or P=NP by MartinodF on Tuesday October 11, 2011 @07:41AM (#3098159)

Thanks! I looked for other entries but couldn't find them. Interesting discussion

[ Parent | on HN ]

Re:3-SAT in polynomial time, or P=NP by s2r2 on Tuesday October 11, 2011 @08:52AM (#3098319)

You're welcome. Got it using the RSS feed. Have you checked the FAQ on the "showdead" option in your profile?

  In my profile, what does showdead do?

  If you turn it on, you'll see all the submissions and comments that have been killed by the editors. They're mostly spam and duplicates.

[ Parent | on HN ]