You Need Much Less Memory than Time
An upcoming STOC conference paper reports a huge near-quadratic improvement that will go down as a true classic complexity theorem.
You Need Much Less Memory than Time
An upcoming STOC conference paper reports a huge near-quadratic improvement that will go down as a true classic complexity theorem.
Fifty Years of P vs. NP and the Possibility of the Impossible
The Status of the P Versus NP Problem
Viewpoint: Time For Computer Science to Grow Up
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved