Computing Applications
Software Managers’ Guide to Operational Excellence
What Do Computing and Economics Have to Say to Each Other?
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits
In this paper, we prove the first superpolynomial lower bounds against algebraic circuits of all constant depths over all fields of characteristic 0.
Technical Perspective: How Easy Is It to Describe Hard Polynomials?
"Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits," by Nutan Limaye et al., achieves a landmark in the larger quest of understanding hardness, dentity testing, and reconstruction.
Governments Are Spying on Your Push Notifications
Energy and Emissions of Machine Learning on Smartphones vs. the Cloud
Autocorrect Is Not: People Are Multilingual and Computer Science Should Be Too
AI Deepnets Throw Light on Ancient History
What Should We Do when Our Ideas of Fairness Conflict?
Beyond the Editorial Analogy: The Future of the First Amendment on the Internet
National Lab Works to Cap, Reduce Carbon
Data Analytics Anywhere and Everywhere
AIrtist: Co-creativity and Computer-Human Collaboration in the Arts
The Perils of ‘Stay In Your Lane’
Shape the Future of Computing
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 InvolvedCommunications of the ACM (CACM) is now a fully Open Access publication.
By opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.
Learn More