From Schneier on Security
Artificial intelligence (AI) has been billed as the next frontier of humanity: the newly available expanse whose exploration
…
B. Schneier| February 29, 2024
Now in one place all of my sixty favorite theorems from the six decades of computational complexity (1965-2024).2015-2024
Graph Isomorphism (Babai)
Sensitivity...Lance Fortnow From Computational Complexity | December 4, 2024 at 08:58 AM
Will our writing all converge to a generic AI style? Let's take a quick detour into LaTeX. Back in the late '80s, before LaTeX was the standard, there was TeX—a...Lance Fortnow From Computational Complexity | November 25, 2024 at 07:59 AM
October EditionI had a tough choice for my final favorite theorem from the decade 2015-2024. Runners up include Pseudodeterministic Primes and Hardness of Partial...Lance Fortnow From Computational Complexity | November 14, 2024 at 02:03 PM
Complexity theorist Steven Rudich passed away on October 29 at the age of 63. His works on Natural Proofs and Program Obfuscation were both highly influential.great...Lance Fortnow From Computational Complexity | November 11, 2024 at 09:05 AM
It feels eerie as pretty much everyone seemingly avoided talking about the election. But Trump back in the White House will likely have a profound effect on USonce...Lance Fortnow From Computational Complexity | November 7, 2024 at 05:18 AM
Junior/Senior lunch in 80°F Chicago
Last summer I attended the Complexity Conference in Ann Arbor for the first time in eight years largely because it was within...Lance Fortnow From Computational Complexity | October 30, 2024 at 09:42 AM
Every now and then I feel like doing a Gasarchian post. This is one of those weeks. I'm going to look at the mathematics behind the American game show Family Feud...Lance Fortnow From Computational Complexity | October 23, 2024 at 10:14 AM
Herb Simon
Herbert Simon while a political scientist in the 1940s at my institution, the Illinois Institute of Technology, developed the theory of bounded rationality...Lance Fortnow From Computational Complexity | October 16, 2024 at 09:46 AM
In the fall, I write a jobs post predicting the upcoming CS faculty job market and giving suggestions and links. In the spring I used to crowdsource a list of where...Lance Fortnow From Computational Complexity | October 9, 2024 at 08:51 AM
September EditionWho thought the algorithm behind machine learning would have cool complexity implications?The Complexity of Gradient Descent: CLS = PPAD ∩ PLSJohn...Lance Fortnow From Computational Complexity | October 2, 2024 at 08:16 AM
I often do LeetCode problems for fun. This site mainly provides short coding problems for students and others to train for the kinds of question that come up in...Lance Fortnow From Computational Complexity | September 26, 2024 at 10:42 AM
Last week I walked around the International Manufacturing Technology Show with 89,000 other participants at the McCormick Center in Chicago. I went to see how AI...Lance Fortnow From Computational Complexity | September 18, 2024 at 01:38 PM
If there's a position where I differ from most other complexity theorists it's that I don't believe that natural proofs present a significant barrier to proving...Lance Fortnow From Computational Complexity | September 11, 2024 at 10:41 AM
August EditionA quasipolynomial-time algorithm for a long standing open problem. Yes, we have two of them this decade.Deciding Parity Games in Quasi-polynomialCristian...Lance Fortnow From Computational Complexity | September 4, 2024 at 09:59 AM
Rendering of PsiQuantum's facility in Chicago
I wasn't looking for quantum this summer but it found me. At various events I ran into some of the most recognized...Lance Fortnow From Computational Complexity | August 29, 2024 at 10:18 AM
Earlier this summer I attended a Celebration for Leonid Levin who recently turned 75. To prepare my talk I wanted to go back to Levin's 1971 two-page Russian masterpiece...Lance Fortnow From Computational Complexity | August 21, 2024 at 10:49 AM
July EditionThis months favorite theorem is a circuit result that implies the polynomial-time hierarchy is infinite relative to a random oracle, answering an open...Lance Fortnow From Computational Complexity | August 14, 2024 at 09:04 AM
Invited Speaker Nutan Limaye, Conference Chair Valentine Kabanets,2024 PC Chair Rahul Santhanam, myself, 2025 PC Chair Srikanth Srinivasanand 2025 Local Arrangements...Lance Fortnow From Computational Complexity | July 24, 2024 at 09:07 AM
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...Lance Fortnow From Computational Complexity | July 18, 2024 at 09:39 AM
June EditionTwo decades ago, I named the recently departed Luca Trevisan's paper connecting extractors to psuedorandom generators as one of my favorite theorems...Lance Fortnow From Computational Complexity | July 10, 2024 at 07:34 AM