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
The Beginnings of Zero-Knowledge
Wired runs this video series where topic expert explain concepts to five levels of difficulty, typically a child, teen, undergrad, grad student and expert. UCLA...
From Computational Complexity
A Failure to Communicate
The screenwriter Aaron Sorkin wrote an article on prioritizing "Truth over Accuracy". He tells stories from his movies The Social Network and Being the Ricardos...
From Computational Complexity
On the California Math Framework
Guest post by Boaz Barak and Jelani Nelson In a recent post, Lance Fortnow critiqued our open letter on the proposed revisions for the California Mathematics Framework...
From Computational Complexity
Complexity Year in Review 2021
The pandemic hampered many activities but research flourished with a number of great results in complexity. Result of the year goes toLocally Testable Codes with...
From Computational Complexity
Fifty Years of P vs. NP and the Possibility of the Impossible
I have a new article Fifty Years of P vs. NP and the Possibility of the Impossible, to mark the 1971 publications of Steve Cook's seminal paper, a month too late...
From Computational Complexity
Defending the Status Quo
When the Wall Street Journal's editorial board and the New York Post endorse your efforts, that should ring warning bells.Several members of the theory and mathematics...
From Computational Complexity
TheoretiCS: New TCS Journal
Guest Post from Paul Beame on behalf of the TheoretiCS FoundationI am writing to let you know of the launch today of TheoretiCS, a new fully open-access journal...
From Computational Complexity
Finding an element with nonadaptive questions
Suppose you have a non-empty subset S of {1,...N} and want to find an element of S. You can ask arbitrary questions of the form "Does S contain an element in A?"...
From Computational Complexity
CS Slow to Change?
Back in March of 2019 I wroteI was also going to post about Yann LeCun's Facebook rant about stodgy CS departments but then Yann goes ahead and wins a Turing award...
From Computational Complexity
20 Years of Algorithmic Game Theory
Twenty years ago DIMACS hosted a Workshop on Computational Issues in Game Theory and Mechanism Design. This wasn't the very beginning of algorithmic game theory...
From Computational Complexity
A Complexity View of Machine Learning?
Complexity is at its best when it models new technologies so we can study it in a principled way. Quantum computing comes to mind as a good relatively recent example...
From Computational Complexity
Fall 2021 Jobs Post
We're in the midst of a great transformation in computing, one where data takes center stage and I predict this will start to have a larger effect on hiring indrop...
From Computational Complexity
A Young Person's Game?
When László Babai first announced his graph isomorphism in quasipolynomial time result, I wroteWe think of theory as a young person's game, most of the big breakthroughs...
From Computational Complexity
C++ is for Cookie and That's Good Enough for Me
Potbelly, a local sandwich chain, made me an offer I couldn't refuse: change my password and earn a free (and quite tasty) oatmeal chocolate chip cookie. A free...
From Computational Complexity
Being the Chair
If you have Netflix and interested in the academic world, I recommend The Chair, a six-episode dramatic series starring Sandra Oh as a new English department chair...
From Computational Complexity
Why Conferences?
An undergrad thesis from North Carolina State University tries to tackle the question as to why computer science has used conferences as its main and most prestigious...
From Computational Complexity
The Death of Expertise
Four years ago I tried to catch up with deep learning and this summer I aimed to try to catch up again. Who would've thought 2017 is ancient history.I watched the...
From Computational Complexity
The hierarchy and GapP
There is a great but little-known theorem from the early 90's by Seinosuke Toda and Mitsunori Ogihara (buried as Lemma 2.3 in their paper) that shows the polynomial...
From Computational Complexity
The Long Road
Guest blogger Varsha Dani tells us why it's never too late.This week, I am starting as an Assistant Professor at RIT and I am super excited about it. What's the...
From Computational Complexity