Text Size
- Home
-
News
Advanced computing news from Communications of the ACM, other ACM resources, and from around the Web.
- Blogs
- Opinion
-
Browse by Subject
Recent articles from Communications organized into categories that encompass the broad scope of computing.
-
Magazine Archive
-
Careers
Jump-start your career with information on trends, opportunities and jobs – in both industry and academia.
- ACM Resources
-
Subscribe
Receive the benefits of ACM membership with a subscription to its flagship publication, Communications of the ACM.
This Article
BLOG@CACM
A Tale of A Serious Attempt At P≠NP
![[article image]](/system/assets/0000/3601/081610_Richard_J_Lipton.large.JPG?1281977592&1281977592)
This is a discussion of the recent claimed proof that P≠NP by Vinay Deolalikar.
User Comments
(2)This is an arcane subject to me. A mere mortal like me can never understand any of these proofs. I have given up but until I read Richard Liptons' comment on this new proof.
I am going back to books and blogs to get a hang of all this. Nicely written to get my interest back on track.
Very nice and informative article.
However, i find it most unfortunate that the possibility of patenting algorithms is suggested (even if it was done tongue in check).
Post a comment...
Tools For Readers
Related ACM Resources
Conferences:
- ITiCSE 2012: 17th Annual Conference on Innovation and Technology in Computer Science Education - July 3 – 5, 2012; Haifa, Israel
Courses:
- Interconnecting Cisco Networking Devices Part 1 (ICND1) v1.0 - This course is a starting point for learning to support a network, regardless of its size and complexity. It provides the knowledge and skills necessary …
About Communications |
Join ACM 
|
Renew |
Subscribe |
Sign In |
For Authors |
For Advertisers |
Privacy |
Site Map |
Help |
Contact Us |
Mobile Site
Copyright © 2012 by the ACM. All rights reserved.