September 1, 2009: Current Communications of the ACM Cover Story Sets Record Downloads
Today's Topic: Current Communications of the ACM Cover Story Sets
September 1, 2009
The cover story in the September issue of Communications of the ACM on "The Status of the P versus NP Problem" set a record number of downloads in its first week of availability in ACM's Digital Library. In fact, the download statistics for this article started accumulating well before the print edition became available.
In the article, author Lance Fortnow of Northwestern University explores one of the fundamental mathematical problems of our time, finding its challenge no closer to unraveling. He chronicles past attempts and approaches to solving the problem and describes a ray of hope in a new long-term project to separate P from NP using algebraic-geometric techniques.
The Fortnow article is open and available to the public in its entirety via the Communications Web site. We encourage you to view the article that has generated such interest and share it with your colleagues.
"The P vs NP problem is the most outstanding problem in theoretical computer science; the interest in its status is enormous," says Moshe Y. Vardi, editor-in-chief of Communications, about the overwhelming response to the cover story.
The article is available at http://doi.acm.org/10.1145/1562164.1562186. Please note that it is necessary to click on the "pdf icon" to get the full text.