P NP ?

Vinay Deolalikar from HP Labs has announced a possible proof that P does not equal NP: see here. Apparently this a fairly serious attack by a serious researcher (previous attacks have all, apparently, come from jokesters who use the well known method of hiding mistakes in jokes.) Will it survive? Watch the complexity blogs closely, my friends :)

This entry was posted in Computer Science. Bookmark the permalink.

3 Responses to P NP ?

  1. dick lipton says:

    Love your site.

    Well-loved. Like or Dislike: Thumb up 9 Thumb down 1

  2. dabacon says:

    @dick lipton : Thanks. I lurk around your blog all the time learning all sorts of interesting computer science :)

    Like or Dislike: Thumb up 2 Thumb down 1

Leave a Reply

Your email address will not be published. Required fields are marked *

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>