Sign In

Communications of the ACM


Refine your search:
datePast Month
authorLance Fortnow

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 ( 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

Breaking Ground in Isomorphism Testing: A Leap Forward for a Bottleneck Case of Group Isomorphism

Guest post by Josh Grochow and Youming QiaoThere has, quietly, been somewhat of a breakthrough in isomorphism testing. No, not as big as Babai's 2016 Graph Isomorphism...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account