Computational Complexity

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

Monday, June 22, 2026

The New Result on Off-diagonal Ramsey Numbers

›
(All references in this blog post can be found in the main article the post is about which is  here .) Recall that \(R(s,k)  \) is the least...
Wednesday, June 17, 2026

The Tech of Silk Road

›
Last week I saw a talk by Northwestern professor Nina Wieda on the history of the Silk Road , a network of trading routes across Asia active...
1 comment:
Sunday, June 14, 2026

mnemonic devices and pangrams that could be real sentences

›
A mnemonic device is a sentence where the first letters of the words are helpful to remember something. My favorite one is                 ...
10 comments:
Wednesday, June 10, 2026

Respect the P v NP Problem

›
There are two ways to look at the P v NP problem, as a formal mathematically defined conjecture as a Clay Millennium Prize Problem, and as t...
12 comments:
Sunday, June 07, 2026

Humans Solve Erdos Problem!!

›
(In 2008 I wrote a survey of some of the known sum-product theorems, see  here . Avi Wigderson has a great slide-set on sum-product theorems...
7 comments:
Wednesday, June 03, 2026

The Industrialization of Academic Research

›
Yesterday, National Academy of Sciences President Marcia McNutt delivered her last annual State of the Sciences Address . Overall the talk b...
4 comments:
Monday, June 01, 2026

Odd Scenarios about Research Claims and Authorships

›
 Odd Scenarios about Research Claims I blogged about OpenAI's achievement of having AI solve a math problem  here . My post had a few co...
6 comments:
Wednesday, May 27, 2026

Authorship in the AI Age

›
The technical paper for the Erdős Unit Distance Problem lists only "OpenAI" as an author. When Bill posted on Sunday about the E...
9 comments:
›
Home
View web version
Powered by Blogger.