acm-header
Sign In

Communications of the ACM

Blogroll


bg-corner

From Computational Complexity

Conference Modality

We have had an almost normal summer conference season, for some sense of normal. At one of those conferences I participated in an hybrid conversation about whether...

From Computational Complexity

The Godfather of Complexity

Juris Hartmanis 1928-2022 On Friday, August 29th, I was in the immigration line at an airport in Mexico. My phone rang with Bill Gasarch on the Caller ID butan...

From Computational Complexity

The Highland Park Shooting

This week I should be celebrating Mark Braverman's Abacus Medal and the Fields Medalists. Instead my mind has been focused 25 miles north of Chicago.Mass shootings...

From Computational Complexity

A Gadget for 3-Colorings

Following up on Bill's post earlier this week on counting the number of 3-colorings, Steven Noble emailed us with some updated information. The first proof that...

From Computational Complexity

The (R)evolution of Steve Jobs

I don't mention it that often in this blog, but I fell in love with opera in the 90's and watch as much as I can, often fitting opera into my travels or vice-versa...

From Computational Complexity

Masks

Illinois Tech removed the last of their mandatory masking restrictions yesterday. Chicago had zero Covid deaths. Yet I still get messages like this in my twitter...

From Computational Complexity

The War and Math

During the early parts of the cold war of the 20th century, we saw two almost independent developments of computational complexity, in the west and in the thenJuris...

From Computational Complexity

Belated happy 80th, Allan Borodin!

Guest Post by Aravind Srinivasan  Allan Borodin turned 80 in 2021. This post is to belatedly wish him a very happy 80th, and to give a short personal perspective...

From Computational Complexity

A Book Break

I got the writing bug back while working on my recent CACM article and I'd like to try my hand at another book. Not sure the exact topic but something related to...

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...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account