The TheoryOverflow site was proposed a few weeks ago for discussion of research-level questions in theoretical computer science. I am committed to using this service, and encourage others in the community to try it out.

(more…)

## 9 August 2010

## 3 August 2010

### TheoryOverflow nearing beta

## 5 July 2010

### FOCS 2010 accepted papers

## 14 June 2010

### CCC 2010

There were several interesting papers at Computational Complexity 2010. Here are just a few, the full list of accepted papers is here. (more…)

## 15 April 2010

### k-ISOLATED SAT

How fast can one decide if a SAT instance has an isolated solution? (more…)

## 23 March 2010

### Immediate SAT restarts?

SAT solvers have been moving to more frequent restarts. Can restarts completely replace local search? (more…)

## Deolalikar’s manuscript

Tags: computational complexity, papers

Given the sudden influx of visitors, it seemed apposite to talk about Vinay Deolalikar’s manuscript titled (or in words, “P is not equal to NP”). (more…)