Computational Complexity

Computational Complexity and other fun stuff in math and computer science from Lance Fortnow and Bill Gasarch

Sunday, November 15, 2026

A More Impressive Use of AI than Proving the Unique Game Conjecture

›
 I have a website devoted to parodies of the song                 I am the very model of a modern major general  here . So I sometimes look ...
2 comments:
Wednesday, November 11, 2026

Fall Jobs Post 2026

›
Each fall I try to predict the upcoming job market for theoretical computer science faculty and give suggestions to those pursuing these pos...
5 comments:
Sunday, November 08, 2026

Demaine-Gasarch-Hajiaghayi have written a book that is a sequel to Garey and Johnson

›
LANCE: You should take a break from all the AI stuff and talk about your book! BILL: I will!  But it's not my book  its co-authored with...
3 comments:
Wednesday, November 04, 2026

Another Step Towards Optiland

›
When the Clay Mathematics Institute announced the Millennium Prize Problems back in 2000, we joked that if you proved P = NP, you wouldn...
7 comments:
Sunday, November 01, 2026

3SUM and APSP and ETH, Oh My!

›
(Throughout this post I will assume that the recent results by OpenAI and Anthropic contain correct proofs of what they claim.) I wrote the ...
10 comments:
Wednesday, October 28, 2026

The Exponential Time Refutation

›
In this week's big news (though it's only Wednesday), OpenAI announced a proof that the exponential-time hypothesis is false , with...
14 comments:
Sunday, October 25, 2026

When is it plausible that a result is optimal?

›
(Lance and Bill did a vidcast about the OpenAI Document Drop. See  here . My spellcheck thinks that vidcast and OpenAI are not words.)   The...
29 comments:
Wednesday, October 21, 2026

Reading Messy Proofs

›
In fall of 1985 when I started graduate school, my advisor Michael Sipser asked me to read an early handwritten manuscript by Johan HÃ¥stad o...
20 comments:
›
Home
View web version
Powered by Blogger.