Computational Complexity
Computational Complexity and other fun stuff in math and computer science.
- By Lance Fortnow, Bill Gasarch
- Based in United States of America
- Roughly two posts per week
- First post on
Posts per month
| Month starting | Posts |
|---|---|
| Dec 2022 | 5 |
| Jan 2023 | 8 |
| Feb 2023 | 8 |
| Mar 2023 | 8 |
| Apr 2023 | 7 |
| May 2023 | 9 |
| Jun 2023 | 6 |
| Jul 2023 | 9 |
| Aug 2023 | 8 |
| Sep 2023 | 7 |
| Oct 2023 | 8 |
| Nov 2023 | 8 |
| Dec 2023 | 6 |
| Jan 2024 | 10 |
| Feb 2024 | 8 |
| Mar 2024 | 8 |
| Apr 2024 | 9 |
| May 2024 | 9 |
| Jun 2024 | 9 |
| Jul 2024 | 8 |
Any gaps could be due to errors when fetching the blog’s feed.
Most recent posts
Invited Speaker Nutan Limaye, Conference Chair Valentine Kabanets,2024 PC Chair Rahul Santhanam, myself, 2025 PC Chair Srikanth Srinivasanand 2025 Local Arrangements chair Swastik Kopparty enjoy some tapas.I have a long history with the Computational Complexity …
On June 21, 1993, at the Issac Newton Institute for Mathematical Science, Andrew Wiles announced that he had proven Fermat's Last Theorem. That wasn't quite right- there was a hole in the proof that was …
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, something practical that quantum could do that seems hard for …