Computational Complexity

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

Wednesday, November 30, 2005

The Graduate Complexity Course

›
After my post on teaching PCPs, a reader questioned the wisdom of spending 6-8 lectures on PCP and asked what topics should be taught in an...
7 comments:
Tuesday, November 29, 2005

Game Theory Finds Computer Science

›
Dear Game Theorist/Computer Scientist: In keeping with our mission "to facilitate cross-fertilization between theories and applicatio...
Sunday, November 27, 2005

Chess and Poker

›
Two very different articles in today's New York Times about battling the decline of interest in Chess. In the Op-Ed section, Jennifer Sh...
14 comments:
Friday, November 25, 2005

Goodbye Computing Chris

›
Chris Leonard, Elsevier editor of the CS theory journals is leaving Elsevier to be head of communities of the digital music service Digimpro...
Wednesday, November 23, 2005

Teaching PCPs

›
Two years ago for the first time, I gave the proof of the PCP (Probabilistically Checkable Proof) theorem in my graduate complexity course. ...
18 comments:
Tuesday, November 22, 2005

Complexity Deadline Approaching

›
The December 4th paper submission deadline for the Computational Complexity Conference in Prague is fast approaching. Get your papers ready...
12 comments:
Monday, November 21, 2005

Introducing a Speaker

›
When a scientist visits another university to give a seminar, someone gets assigned as host who during the talk introduces the speaker, make...
3 comments:
Saturday, November 19, 2005

Another Satisfied Customer

›
You attend the University of Chicago for three years, take a few years off and come back to finish your Bachelor's degree in Chemistry. ...
5 comments:
Thursday, November 17, 2005

Relativized Collapse of P and NP

›
When we teach relativization, we often ask the class for a set A such that P A =NP A . The usual answers we get are an NP-complete A (which ...
6 comments:
Wednesday, November 16, 2005

Cornell versus Intelligent Design

›
As a Cornell University alum I get the occasional email from the president talking about the great things going on on the Ithaca campus. Tod...
16 comments:
Tuesday, November 15, 2005

The History of RAM

›
Janos Simon gives a history of RAMs expanding on my recent Favorite Theorems post . A single paper is like a snapshot of the state of rese...
6 comments:
Monday, November 14, 2005

Acceptance Rates versus Competitiveness

›
The acceptance rates at conferences for theoretical computer scientists tend to run higher than acceptance rates at conferences in other are...
20 comments:
Saturday, November 12, 2005

The Enemy of the Good

›
Alice (not the real name) has a STOC submission with Bob and wanted to put the paper on a public archive. Bob insists that the paper not go ...
5 comments:
Thursday, November 10, 2005

Favorite Theorems: Defining the Future

›
October Edition We end the list of favorite theorems from 1965-74 with two seminal papers by Cook and Reckhow. Stephen Cook and Robert R...
7 comments:
Tuesday, November 08, 2005

Negotiating Your Job

›
An excellent Chronicle article on negotiating your job offer. I fully agree with the article that you lose out considerably by not negotiat...
9 comments:
Monday, November 07, 2005

Games for Girls

›
This notice came into my inbox last week. ChicTech, an outreach program of the University of Illinois Department of Computer Science, exten...
11 comments:
Saturday, November 05, 2005

Bringing Complexity to Your iPod

›
Welcome to ComplexityCast, the first of a very occasional podcast, an audio version of this weblog. First up, Bill Gasarch and I talk about...
14 comments:
Friday, November 04, 2005

Whither to Compete

›
A guest post by Rakesh Vohra. Fortnow's post on competitive ratio's has prompted a number to speculate on the `right' number ...
5 comments:
Thursday, November 03, 2005

Losing the Office Phone

›
About a month ago I had the phone in my office removed. The number was one digit off from both maternity and a nurse's station at the U ...
2 comments:
Tuesday, November 01, 2005

Competitive Analysis

›
When you cannot achieve the optimum solution of a problem, how do you measure the performance of an algorithm? If you knew the distribution ...
23 comments:
‹
›
Home
View web version
Powered by Blogger.