Computational Complexity

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

Tuesday, August 31, 2010

Report from Barriers II Part 1

›
On Thursday Aug 26 Lance stated Bill is at Barriers II in Princeton and promises a full report upon his return. Not quite sure I promised ...
12 comments:
Monday, August 30, 2010

New Institute for Theory of Computing

›
The Simons Foundation has announced a competition to establish a new Institute for the Theory of Computing in the United States. Computat...
13 comments:
Friday, August 27, 2010

Theory Journals

›
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 dilige...
3 comments:
Thursday, August 26, 2010

Cryptography if P = NP

›
Bill is at Barriers II in Princeton and promises a full report upon his return. Ask many computer scientists what happens if P = NP and y...
25 comments:
Wednesday, August 25, 2010

***SORELLE*** PHD!!/Workshop on Boolean Threshold Functions/NSF program

›
Three annoucements (the last two I was asked to post) ANNOUCEMENT 1: Congrads to fellow blogger ***SORELLE*** who got her PhD recently. I...
9 comments:
Tuesday, August 24, 2010

NEW math on Futurama

›
The Aug 19, 2010 episode of Futurama had NEW math in it! It also has some other math refs. This website claims that Ken Keeler, one of ...
8 comments:
Monday, August 23, 2010

Is Scheduling a Solved Problem? (Guest Post)

›
(Guest Post by Ben Fulton.) "At first glance, scheduling does not seem like a topic that requires much attention from computer scie...
3 comments:
Saturday, August 21, 2010

Comments

›
Bill and I are strong believers in freedom of speech and have long since had an open comment policy, allowing anonymous comments, no moderat...
43 comments:
Friday, August 20, 2010

NSF Updates

›
Many changes at the National Science Foundation both in programs and personnel. Some highlights of upcoming  CISE programs . Expeditions  ...
12 comments:
Thursday, August 19, 2010

Spielman Receives the Nevanlinna Prize

›
Dan Spielman wins the Nevanlinna prize for "smoothed analysis of Linear Programming, algorithms for graph-based codes and applications...
12 comments:
Wednesday, August 18, 2010

Today is Paul Turan's 100th Birthday!

›
The following conversation is a fictional version of a real conversation. Lance: Bill, Wed August 18, 2010 is Paul Turan's 100th bi...
16 comments:
Tuesday, August 17, 2010

My last post on the alleged P NE NP paper

›
(This is likely my last post on the alleged P NE NP paper unless more real news on it occurs. The only real news I can see happening at this...
95 comments:
Monday, August 16, 2010

But This One Is Different...

›
This summer I took a two part vacation: Touring Ireland July 26-August 5, with my wife to celebrate twenty years of marriage and a short tri...
66 comments:
Friday, August 13, 2010

P vs NP vs IEEE (Guest post by Paul Beame)

›
(Update on P vs NP: The proof uses Finite Model Theory which is sometimes called That stuff that Neil Immerman does. . Neil Immerman has fou...
8 comments:
Wednesday, August 11, 2010

Factoring in P ?

›
(Update on alleged P NE NP proof: There are some issues with it. See these posts on Lipton's blog: here and here and also see a Wikip...
9 comments:
Monday, August 09, 2010

That P ne NP proof- whats up with that?

›
Let me be he last on the block to tell you that an alleged proof of P ≠ NP is out there. NOT posting on it would be absurd; however, I canno...
14 comments:
Wednesday, August 04, 2010

The Solution to the Mark-Betty Game

›
RECALL from my last post the following game: Let f(n) be a non-decreasing function from naturals to naturals. Consider the following ga...
15 comments:
Monday, August 02, 2010

I want your intuitions on this, so the less you know the more I want you to post

›
Let f(n) be a monotone increasing function from N to N. (CLARIFICATION ADDED LATER: N is the naturals., f is non-decreasing) Consider the fo...
26 comments:
Thursday, July 29, 2010

What is the complexity of these problems and metaproblems?

›
The following problem is from Doctor Eco's Cyberpuzzles . I have shortened and generalized it. We are going to put numbers into boxes....
9 comments:
Tuesday, July 27, 2010

This Post is Quite Different from any you've ever read!!

›
I recently a letter from WETA (public TV) which I quote from: This letter is quite different from any we've ever sent to you. For ye...
21 comments:
‹
›
Home
View web version
Powered by Blogger.