Computational Complexity

Computational Complexity and other fun stuff in math and computer science from Lance Fortnow and Bill Gasarch

Sunday, November 23, 2014

Guest Post about Barbie `I can be an engineer' -- Sounds good but its not.

›
There is now a I can be an engineer Barbie. That sounds good! It's not. Imagine how this could be turned around and made sexist. What y...
6 comments:
Thursday, November 20, 2014

A November to Remember

›
The Imitation Game  starring Benedict Cumberbatch as Alan Turing opens in the US on November 28. If you read this blog you should see that m...
10 comments:
Monday, November 17, 2014

A Fly on the wall for a Harvard Faculty meeting: Not interesting for Gossip but interesting for a more important reason

›
I was recently in Boston for Mikefest (which Lance talked about  here)   and found time to talk to  my adviser Harry Lewis at Harvard (advi...
6 comments:
Thursday, November 13, 2014

From Homework Solution to Research Paper

›
Inspired by the Dantzig Story   I occasionally put an open problem on a class assignment. Never worked, though I did have a student get a re...
5 comments:
Tuesday, November 11, 2014

Non controversial thoughts on rankings

›
US News has a ranking of CS depts and various subcategories. Recently MohammadTaghi Hajiaghay and Luca Trevisan have suggested alternative r...
7 comments:
Saturday, November 08, 2014

George Dantzig >= 100

›
We celebrate the 100th anniversary of the birth of George Dantzig today. In his obituary post  we talked about his work on optimization, par...
3 comments:
Wednesday, November 05, 2014

Favorite Theorems: Circuit Lower Bounds

›
My long time blog readers should have no surprise on my final favorite theorem of 2005-2014. Nonuniform ACC Circuit Lower Bounds by Ryan ...
1 comment:
Monday, November 03, 2014

A few more notes about Sipser and Sipser-60th

›
While Lance was AT Mikefest (Sipser's 60th Bday conference), helping to organize it, emceeing the personal statements, I was... also th...
4 comments:
Thursday, October 30, 2014

Metrics in Academics

›
Congratulations to the San Francisco Giants, winning the World Series last night. In honor of their victory let's talk metrics. Baseball...
18 comments:
Tuesday, October 28, 2014

Sipser Symposium

›
On Sunday we had the Symposium on Theoretical Computer Science on the Occasion of Michael Sipser's 60th birthday to celebrate what M...
7 comments:
Thursday, October 23, 2014

Guest Post by Dr. Hajiaghayi: A new way to rank departments

›
(This is a guest post by MohammadTaghi Hajiaghayi. His name is not a typo- the first name really is MohammadTaghi.) Due to our belief in t...
48 comments:
Wednesday, October 22, 2014

MSR SVC Letters

›
The Committee for the Advancement of Theoretical Computer Science put together an open letter to several research leaders at Microsoft. We...
11 comments:
Tuesday, October 21, 2014

Martin Gardner Centennial

›
Martin Gardner was born on October 21, 1914, so today is his Centennial (he died on May 22, 2010, at the age of 95). We've mentioned him...
3 comments:
Thursday, October 16, 2014

The Curious Case of NP and NEXP

›
NP (nondeterministic polynomial time) and NEXP (nondeterministic exponential time) are provably different classes by the nondeterministic ti...
Monday, October 13, 2014

Luddite or not?

›
My first ever guest post for Lance was on Are you a luddite . I certainly am to some extent a luddite, but there are some things where it no...
Thursday, October 09, 2014

2014 Fall Jobs Post

›
Tis the season for the fall jobs post. Please list any jobs, academic or industrial, in theoretical computer science broadly construed in th...
36 comments:
Monday, October 06, 2014

The Complexity of NIM. Open?

›
Recall 1-pile NIM: Let A be a finite set of Naturals. NIM(A) is the following game: There are n stones on the board. Players I and II alte...
8 comments:
Thursday, October 02, 2014

Favorite Theorems: Multilinear Circuits

›
In the past decade we have seen a strong program in algebraic circuit complexity. If you just define circuits using multiplication and addit...
Tuesday, September 30, 2014

Dagstuhl on Algebra in Computational Complexity

›
(Reminder- Theory day at UMCP:  here is the link. ) There was a Dagstuhl on Algebra in Computational Complexity Sept 22-26. I learned st...
1 comment:
Saturday, September 27, 2014

MikeFest

›
I rarely highlight individual events on the blog, but one's advisor only turns sixty once. We will honor Michael Sipser  at MIT on Sund...
1 comment:
‹
›
Home
View web version
Powered by Blogger.