Communications of the ACM
Refine your search:
How the “Frontier” Became the Slogan of Uncontrolled AI
Artificial intelligence (AI) has been billed as the next frontier of humanity: the newly available expanse whose exploration …
From Computational Complexity
Natural Proofs is Not the Barrier You Think It Is
If there's a position where I differ from most other complexity theorists it's that I don't believe that natural proofs present a significant barrier to proving...
From Computational Complexity
Favorite Theorems: Parity Games
August EditionA quasipolynomial-time algorithm for a long standing open problem. Yes, we have two of them this decade.Deciding Parity Games in Quasi-polynomialCristian...
From Computational Complexity
My Quantum Summer
Rendering of PsiQuantum's facility in Chicago I wasn't looking for quantum this summer but it found me. At various events I ran into some of the most recognized...
From Computational Complexity
The Levin Translation
Earlier this summer I attended a Celebration for Leonid Levin who recently turned 75. To prepare my talk I wanted to go back to Levin's 1971 two-page Russian masterpiece...
From Computational Complexity
Favorite Theorems: Random Oracles
July EditionThis months favorite theorem is a circuit result that implies the polynomial-time hierarchy is infinite relative to a random oracle, answering an open...
From Computational Complexity
Complexity in Michigan
Invited Speaker Nutan Limaye, Conference Chair Valentine Kabanets,2024 PC Chair Rahul Santhanam, myself, 2025 PC Chair Srikanth Srinivasanand 2025 Local Arrangements...
From Computational Complexity
The Story of Shor's Algorithm
The quantum factoring algorithm of Peter Shor (FOCS 1994, SIAM Review 1999) turns thirty this year. Before his algorithm, quantum computing lacked the killer app...
From Computational Complexity
Favorite Theorems: Extracting Ramsey Graphs
June EditionTwo decades ago, I named the recently departed Luca Trevisan's paper connecting extractors to psuedorandom generators as one of my favorite theorems...
From Computational Complexity
Why is called the Turing Award (revisited)?
Avi Wigderson gave his ACM Turing Award lecture last week, and instead of telling his own story, he focused on Alan Turing and his influence on complexity. If you...
From Computational Complexity
E versus EXP
Why do we have two complexity classes for exponential time, E and EXP?First the definitions:E is the set of problems computable in time \(2^{O(n)}\).EXP is theMIP...
From Computational Complexity
Luca Trevisan (1971-2024)
Complexity theorist Luca Trevisan lost his battle to cancer yesterday in Milan at the age of 52. A terrible loss for our community and our hearts go out to hisTCS4All...
From Computational Complexity
Rethinking Hueristica
I've argued that more and more we seem to live in an Optiland, a computational utopia where through recent developments in optimization and learning we can solve...
From Computational Complexity
Favorite Theorems: Algebraic Circuits
Most of my favorite theorems tell us something new about the world of complexity. But let's not forget the greatest technical challenges in our area: proving separations...
From Computational Complexity
The Godzilla Moment
On the plane earlier this week I got around to watching the Academy Award winning movie Godzilla Minus One, one of the best monster movies I've seen set in Japan...
From Computational Complexity
Double Digit Delights
It started with a post from Fermat's Library. 132 is the sum of all the 2-digit numbers made from its digits. It is the smallest such number. pic.twitter.com/hrByAXbr51...
From Computational Complexity
Peer Review
Daniel Lemire wrote a blog post Peer Review is Not the Gold Standard in Science. I wonder who was claiming it was. There is whole section of an online Responsible...
From Computational Complexity
Jim Simons (1938-2024)
Jim Simons passed away Friday at the age of 86. In short he was a math professor who quit to use math to make money before it was fashionable and used part of his...
From Computational Complexity
Favorite Theorems: Dichotomy
A constraint satisfaction problem has a group of constraints applied to a set of variables and we want to know if there is a setting of the variables that makeA...
From Computational Complexity
Our Obsession with Proofs
Bullinger's post on this blog last week focused on Vijay Vazirani's public obsession of finding a proof for the 1980 Micali-Vazirani matching algorithm. But why...
From Computational Complexity