Blogroll | Communications of the ACM

From Computational Complexity

Corporate Education

First of all read the #metoo testimonial going around the TCS blogosphere. Our field is not immune. Last Sunday Frank Bruni wrote an op-ed column Corporations,... Lance Fortnow
From Computational Complexity | February 15, 2018 at 08:09 AM

From Computational Complexity

For the Love of Algorithms

Wired magazine labelled 2017 as The Year We Fell Out of Love with Algorithms. The article goes on to talk about how algorithms give us filter bubbles, affect elections... Lance Fortnow
From Computational Complexity | February 8, 2018 at 07:42 AM

From Computational Complexity

Flying Blind

Many computer science conferences have made a number of innovations such as a rebuttal phase, multi-tiered program committees, a hybrid journal/conference model... Lance Fortnow
From Computational Complexity | February 1, 2018 at 01:06 PM

From Computational Complexity

From Art to Science

Q: Why did the neural net cross the road? A: Who cares along as it got to the other side. Whit Diffie and Martin Hellman in their classic 1976 paper talk about... Lance Fortnow
From Computational Complexity | January 26, 2018 at 09:18 AM

From Computational Complexity

A Sensitive Game

Last month I posted about the sensitivity conjecture and today I would like to talk about an interesting game developed by Gilmer, Koucký and Saks and independently... Lance Fortnow
From Computational Complexity | January 18, 2018 at 12:47 PM

From Computational Complexity

Donald Knuth Turns Eighty

We've kept this blog going long enough that we start repeating our celebrations. Ten years ago Bill celebrated Don Knuth's 70th Birthday and today Donald Knuthcelebrates... Lance Fortnow
From Computational Complexity | January 10, 2018 at 08:26 AM

From Computational Complexity

Complexity Year in Review 2017

Theorem of the year goes to the resolution of the dichotomy conjecture. I wrote about the conjecture in February and while the Feder et. al paper didn't hold up... Lance Fortnow
From Computational Complexity | December 27, 2017 at 01:40 PM

From Computational Complexity

Having Faith in Complexity

I believe P ≠ NP as much as anyone else. Nevertheless should we worry about trust we put in complexity? You don't need the full power of P = NP to break cryptography... Lance Fortnow
From Computational Complexity | December 21, 2017 at 10:14 AM

From Computational Complexity

Our AI future: The good and the Ugly

I don’t directly work in machine learning but one cannot deny the progress it has made and the effect it has on society. Who would have thought even a few years... Lance Fortnow
From Computational Complexity | December 13, 2017 at 01:46 PM

From Computational Complexity

Razor's Edge

Informally the sensitivity conjecture asks whether every hard Boolean function has a razor's edge input, where flipping a random bit has a reasonable chance ofrecent... Lance Fortnow
From Computational Complexity | December 7, 2017 at 10:21 AM

From Computational Complexity

Kolmogorov Complexity and the Primes

Bill's post on how to derive the non-finiteness of the primes from Van der Waerden's theorem reminds me of a nice proof using Kolmogorov complexity. A quick primer... Lance Fortnow
From Computational Complexity | November 30, 2017 at 07:35 AM

From Computational Complexity

The Grad Student Tax

By now as you've read from Luca or Scott or PhD Comics or a variety of other sources on the dangerous changes to the tax code that passed the US House of Representatives... Lance Fortnow
From Computational Complexity | November 20, 2017 at 08:15 AM

From Computational Complexity

A Tale of Three Rankings

In the Spring of 2018 the US News and World Report should release their latest rankings of US graduate science programs including computer science. These are the... Lance Fortnow
From Computational Complexity | November 16, 2017 at 08:42 AM

From Computational Complexity

Advice for the Advisor

A soon-to-be professor asked me recently if I could share some ideas on on how to advise students. I started to write some notes only to realize that I had already... Lance Fortnow
From Computational Complexity | November 9, 2017 at 02:08 PM

From Computational Complexity

Matching and Complexity

Given a group of people, can you pair them up so that each pair are Facebook friends with each other? This is the famous perfect matching problem. The complexity... Lance Fortnow
From Computational Complexity | November 2, 2017 at 10:44 AM

From Computational Complexity

2017 Fall Jobs Post

You're finishing up grad school or a postdoc and ask yourself what should I do for the rest of my life? We can't answer that for you but we can help you figureCRA... Lance Fortnow
From Computational Complexity | October 26, 2017 at 11:04 AM

From Computational Complexity

The Amazon Gold Rush

Unless you have hidden under a rock, Amazon wants to build a second headquarters in or near a large North American city. Amazon put out a nice old fashioned... Lance Fortnow
From Computational Complexity | October 19, 2017 at 09:15 AM

From Computational Complexity

Lessons from the Nobel Prizes

We've had a big week of awards with the Nobel Prizes and the MacArthur "Genius" Fellows. The MacArthur Fellows include two computer scientists, Regina Barzilay and... Lance Fortnow
From Computational Complexity | October 12, 2017 at 08:52 AM

From Computational Complexity

Monty Hall (1921-2017) and His Problem

Monty Hall passed away yesterday, best known for co-creating and hosting the game show The Price is Right, a show I occasionally watched as a kid. To the best... Lance Fortnow
From Computational Complexity | October 1, 2017 at 02:44 PM

From Computational Complexity

Tragic Losses

I'd like to remember two young people who's lives were taken way too early. I didn't know either well but both played large roles in two different communities... Lance Fortnow
From Computational Complexity | September 28, 2017 at 10:20 AM