Computational Complexity

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

Monday, December 28, 2009

2009 Complexity Year in Review

›
We go all the way back to January for the paper of the year, Mark Braverman's  Poly-logarithmic independence fools AC0 circuits . Runner...
4 comments:
Tuesday, December 22, 2009

How to tell how good a TV show is

›
(This is my last blog of the year. Lance will interrupt his blog sabbatical to do an END OF THE YEAR blog later.) The TV show MONK rece...
14 comments:
Friday, December 18, 2009

What is an explicit Construction?

›
The Prob method (usually credited to Erdos) was once considered quite novel: You show something exists but you don't show how to constru...
8 comments:
Thursday, December 17, 2009

A hard problem inspired by an easy problem

›
The following problem was problem 1 (the easy one) on the Maryland Math Competition 2009 (I will later report on how the students did on it...
25 comments:
Wednesday, December 16, 2009

Guest Post- Women in Theory Workshop

›
(Tal Rabin requested to post this so I am doing so. This post is essentially her email, so call it a guest post.) There will be a Women ...
2 comments:
Tuesday, December 15, 2009

Mild Request for Guest Posters.

›
(Deadline to submit a paper to CCC is Dec 15. Depending on when you read this that could be today or in the past.) As you all know fro...
7 comments:
Monday, December 14, 2009

CCC deadline Dec 15, 2009! (not factorial)

›
Submissions to 25th CCC are due TOMORROW! (Actually it could be TOMORROW, TODAY, or IN THE PAST depending on when you read this.) Should yo...
2 comments:
Friday, December 11, 2009

A Blog Sabbatical

›
With the end of the fall quarter I will take a break from the blog for a few months. This is not another End , just a chance to move my crea...
10 comments:
Thursday, December 10, 2009

Whats your Game Mr. Bond? Nim?

›
BILL : Clyde is teaching a graduate course titled Games, Game Theory, and the Theory of Games . He tells me that there are basically eight k...
18 comments:
Wednesday, December 09, 2009

Is posting about 17x17 problem BAD FOR ACADEMIA?

›
(The 17x17 problem has gotten far wider attention than I imagined--- Brian Hayes posted it on his website: here , and its also here and her...
29 comments:
Tuesday, December 08, 2009

Dequantification

›
After a talk on derandomization at Midwest Theory Day, someone asked if those techniques could also be used in quantum computing.  In cla...
17 comments:
Monday, December 07, 2009

Complexity Vidcast 3

›
Quick announcement: If you are a student who wants to go to SODA but doesn't have the funds, click here . I had forgotten we did this. ...
9 comments:
Friday, December 04, 2009

The Probability of P=NP

›
Dean Foster asked me for a probability that P=NP. Now P=NP is not a probabilistic event, either P=NP or P≠NP (if it's independent it...
21 comments:
Thursday, December 03, 2009

Congrats to new ACM fellows

›
Congrats to ALL of the ACM Fellows which were annouced here . There are several theorists among them. I could try to list them or count ...
8 comments:
Wednesday, December 02, 2009

17x17: Comments on your comments

›
One of the comments on my last post, the 17x17 post, inquired if I am also interested in the other unknown grids (NOW just 17x18, 18x18,21x1...
19 comments:
Tuesday, December 01, 2009

Who Pays for Trips?

›
If Professor Alice at Faber College visits Dr. Bob at the University of Southern North Dakota, who should cover Alice's expenses?  It de...
7 comments:
Monday, November 30, 2009

The 17x17 challenge. Worth $289.00. This is not a joke.

›
The 17x17 challenge: worth $289.00. I am not kidding. Definition: The n x m grid is c-colorable if there is a way to c-color the vertic...
157 comments:
Wednesday, November 25, 2009

Birthday Paradox Variance

›
First a message from David Johnson for proposals on locations for SODA 2012 both in and outside the US. Here's an interesting approac...
14 comments:
Tuesday, November 24, 2009

DIMACS at 20

›
Last Friday DIMACS celebrated its 20th anniversary. Muthu summarizes the event. DIMACS  has served the theoretical computer science comm...
1 comment:
Monday, November 23, 2009

An undervalued Math Problem

›
As most of you know there are 7 problems worth $1,000,000 (see here ). It may be just 6 since Poincare's conjecture has probably been s...
9 comments:
‹
›
Home
View web version
Powered by Blogger.