anhinga_anhinga (anhinga_anhinga) wrote,
anhinga_anhinga
anhinga_anhinga

From a workshop on role of theory in design automation

"One of the recurrent themes of the discussion is: we have SAT solvers that seem to work on all examples we try them on. How does this fit with the conventional wisdom that P not equal to NP? This is a very interesting open problem, that we should work on in the future."

from http://rjlipton.wordpress.com/2009/07/09/nsf-workshop-summary/ via rjlipton
Tags: computer science
Subscribe
  • Post a new comment

    Error

    default userpic

    Your reply will be screened

    When you submit the form an invisible reCAPTCHA check will be performed.
    You must follow the Privacy Policy and Google Terms of use.
  • 4 comments