Please create an account to participate in the Slashdot moderation system


Forgot your password?
Check out the new SourceForge HTML5 internet speed test! No Flash necessary and runs on all devices. ×

Submission + - P != NP - or does it?

Coz writes: Vinay Deolalikar of HP published a "proof" last week that P != NP — one of the Holy Grails of computational theory. Since then, there have been several lively discussions on whether, and how, the proof holds up, and even the NY Times has weighted in — although their emphasis is on how fast the review has been, in the degree to which technologies have been employed to generate deeper insight and allow more people to examine such things faster.
This discussion was created for logged-in users only, but now has been archived. No new comments can be posted.

P != NP - or does it?

Comments Filter:

To do two things at once is to do neither. -- Publilius Syrus