acm-header
Sign In

Communications of the ACM

Blogroll


Refine your search:
datePast Week
authorLance
bg-corner

From Computational Complexity

Favorite Theorems: Learning from Natural Proofs

October EditionI had a tough choice for my final favorite theorem from the decade 2015-2024. Runners up include Pseudodeterministic Primes and Hardness of Partial...

From Computational Complexity

Steven Rudich (1961-2024)

Complexity theorist Steven Rudich passed away on October 29 at the age of 63. His works on Natural Proofs and Program Obfuscation were both highly influential.great...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account