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
On October 8th, when in my graduate complexity course as we discussed the 1987 Razborov-Smolensky result that one can't compute the Modp by constant-depth polynomial...Lance From Computational Complexity | November 9, 2010 at 01:13 PM
You can now watch videos of the recent FOCS talks online. Glencora, who I had the pleasure of meeting at the conference, has her favorites. If you watch any, check...Lance From Computational Complexity | November 8, 2010 at 12:07 PM
In 1973 Donald Knuth searched for a name for the hardest problems in NP. Steve Cook didn't give a name in his paper and Karp called them P-complete. Knuth suggested...Lance From Computational Complexity | November 1, 2010 at 02:11 PM
I'm heading back to Chicago this morning. Dan Spielman had a special talk in honor of his recent Nevanlinna prize. He gave an amazing talk (as always) about solving...Lance From Computational Complexity | October 26, 2010 at 01:24 PM
Some thoughts from the FOCS conference in Las Vegas. One result I hadn't seen before I heard people excited by, Determinant Sums for Undirected Hamiltonicity by Andreas...Lance From Computational Complexity | October 25, 2010 at 12:24 PM
Former blogger Michael Mitzenmacher talks about being chair and not blogging. In a day for guest posts, over at Geomblog, David Johnson wants to know practical
...Lance From Computational Complexity | October 20, 2010 at 10:24 AM
Last week I had a pleasant short trip to Aarhus, Denmark for the inauguration of the new Center for Research in the Foundations of Electronic Markets. Kevin Leyton...Lance From Computational Complexity | October 19, 2010 at 11:36 AM
Clouds are not spheres, mountains are not cones, coastlines are not circles, and bark is not smooth, nor does lightning travel in a straight line.Lance From Computational Complexity | October 18, 2010 at 12:53 PM
As I've mentioned before, the NSF is turning over top to bottom especially in computer science. Most of the pieces are now in place so let's check out the new personnel...Lance From Computational Complexity | October 11, 2010 at 10:52 AM
University of Chicago Computer Science and Statistics Professor Partha Niyogi passed away on Friday after a battle with brain cancer. Partha worked in machine...Lance From Computational Complexity | October 5, 2010 at 01:06 PM
The CRA is working on setting guidelines for job deadlines to help out with some of the gridlock in the job market. Many of the top departments have already moved...Lance From Computational Complexity | October 4, 2010 at 02:56 PM
The NRC "rankings" of Graduate programs was released yesterday. I put up a Google spreadsheet of the CS rankings. Phds.org will also generate rankings using various...Lance From Computational Complexity | September 29, 2010 at 10:01 AM
Derrick Stolee tweeted that the videos from the 2010 Complexity Conference are now on-line. If you want to attend a conference live, don't forget early hotel and...Lance From Computational Complexity | September 27, 2010 at 10:21 AM
The New York Times Magazine last Sunday focused on technology on education. Lots of good reads but what caught my eye was an article by Microsoft Research's Jaron...Lance From Computational Complexity | September 21, 2010 at 11:24 AM
Suppose you happen to have $150 million burning in your pocket that you want to use to help the theoretical computer science community ($150 million endowed will...Lance From Computational Complexity | September 14, 2010 at 11:30 AM
The program for the FOCS 2010 has an excellent set of selected papers and in addition has tutorials on Saturday by Ketan Mulmuley, Mihai Patrascu, and Tim Roughgarden...Lance From Computational Complexity | September 13, 2010 at 10:49 AM
First some conference news: FOCS conference and hotel registration available on line, early deadline is September 30. STOC 2011 website is up with the CFP, deadline...Lance From Computational Complexity | September 7, 2010 at 12:43 PM
Yesterday I was at a meeting of the CCC Council, add in a couple of emails and I have lots of short notes on CS stuff.
In these meetings I get to hear about CS...Lance From Computational Complexity | September 3, 2010 at 12:47 PM
The Simons Foundation has announced a competition to establish a new Institute for the Theory of Computing in the United States.
Computation (and its abstractTTI...Lance From Computational Complexity | August 30, 2010 at 11:11 AM
I got the following request from a reader.
I have a question about TCS journals. As I am trying to follow your advice on being more diligent about journalizing...Lance From Computational Complexity | August 27, 2010 at 10:26 AM