Communications of the ACM
Refine your search:
Chinese Hacking of U.S. Critical Infrastructure
Everyone is writing about an interagency and international report on Chinese hacking of US critical infrastructure.
Lots of…
From Computational Complexity
Finding Primes Pseudodeterministically
In 2003, Agrawal, Kayal and Saxena showed that primality testing is in P, i.e., you could test for primes without using any randomness.What if you want to findposted...
From Computational Complexity
Community Guidelines that Ignore History
Last week I got the following email from Blogger:As you may know, our Community Guidelines (https://blogger.com/go/contentpolicy) describe the boundaries for what...
From Computational Complexity
Winter is Coming
I fear we are heading to a computer science winter. Now why would I say that when CS enrollments are at record levels and AI is driving incredible excitement in...
From Computational Complexity