| Welcome to Crypto. We hope you enjoy your visit. You're currently viewing our forum as a guest. This means you are limited to certain areas of the board and there are some features you can't use. If you join our community, you'll be able to access member-only sections, and use many member-only features such as customizing your profile, sending personal messages, and voting in polls. Registration is simple, fast, and completely free. Join our community! If you're already a member please log in to your account to access all of our features: |
| HP Researcher claims prrof that P != NP | |
|---|---|
| Tweet Topic Started: Aug 9 2010, 07:10 PM (678 Views) | |
| fiziwig | Aug 9 2010, 07:10 PM Post #1 |
|
Elite member
![]() ![]() ![]() ![]() ![]() ![]() ![]()
|
http://gregbaker.ca/blog/2010/08/07/p-n-np/ For background on the crypto implications: http://en.wikipedia.org/wiki/P_versus_NP_problem |
![]() |
|
| jdege | Aug 9 2010, 09:01 PM Post #2 |
|
NSA worthy
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]()
|
I can't see that a proof that P!=NP is going have much effect. Everyone had always assumed it was true, and those who built systems based on it always hoped it was true, and I'm sure they're going to be sleeping more soundly, but it won't change much. Consider, on the other hand, how the world would have changed if someone had proved the P==NP - who had found a fast solution for TSP and the rest. The consequences would be huge. Edited by jdege, Aug 10 2010, 01:40 AM.
|
| When cryptography is outlawed, bayl bhgynjf jvyy unir cevinpl. | |
![]() |
|
| 1 user reading this topic (1 Guest and 0 Anonymous) | |
| « Previous Topic · News · Next Topic » |





![]](http://z2.ifrm.com/static/1/pip_r.png)



12:15 AM Jul 11