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
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...Lance Fortnow From Computational Complexity | February 14, 2022 at 08:32 AM
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...Lance Fortnow From Computational Complexity | February 8, 2022 at 06:00 PM
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...Lance Fortnow From Computational Complexity | February 2, 2022 at 04:46 PM
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...Lance Fortnow From Computational Complexity | January 26, 2022 at 12:49 PM
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...Lance Fortnow From Computational Complexity | January 12, 2022 at 10:32 AM
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...Lance Fortnow From Computational Complexity | December 23, 2021 at 09:20 AM
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...Lance Fortnow From Computational Complexity | December 17, 2021 at 02:33 PM
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...Lance Fortnow From Computational Complexity | December 8, 2021 at 02:22 PM
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...Lance Fortnow From Computational Complexity | December 1, 2021 at 09:06 AM
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?"...Lance Fortnow From Computational Complexity | November 22, 2021 at 03:39 PM
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...Lance Fortnow From Computational Complexity | November 17, 2021 at 01:44 PM
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...Lance Fortnow From Computational Complexity | November 11, 2021 at 07:57 AM
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...Lance Fortnow From Computational Complexity | November 3, 2021 at 10:39 AM
We're in the midst of a great transformation in computing, one where data takes center stage and I predict this will start to have a larger effect on hiring indrop...Lance Fortnow From Computational Complexity | October 27, 2021 at 05:52 PM
When László Babai first announced his graph isomorphism in quasipolynomial time result, I wroteWe think of theory as a young person's game, most of the big breakthroughs...Lance Fortnow From Computational Complexity | October 15, 2021 at 09:32 AM
Potbelly, a local sandwich chain, made me an offer I couldn't refuse: change my password and earn a free (and quite tasty) oatmeal chocolate chip cookie. A free...Lance Fortnow From Computational Complexity | October 8, 2021 at 11:10 AM
If you have Netflix and interested in the academic world, I recommend The Chair, a six-episode dramatic series starring Sandra Oh as a new English department chair...Lance Fortnow From Computational Complexity | September 30, 2021 at 10:29 AM
An undergrad thesis from North Carolina State University tries to tackle the question as to why computer science has used conferences as its main and most prestigious...Lance Fortnow From Computational Complexity | September 23, 2021 at 08:54 AM
Four years ago I tried to catch up with deep learning and this summer I aimed to try to catch up again. Who would've thought 2017 is ancient history.I watched the...Lance Fortnow From Computational Complexity | September 9, 2021 at 10:40 AM
There is a great but little-known theorem from the early 90's by Seinosuke Toda and Mitsunori Ogihara (buried as Lemma 2.3 in their paper) that shows the polynomial...Lance Fortnow From Computational Complexity | September 2, 2021 at 09:25 AM