Beware normal hypergraph landmine

In a classic 1972 paper László Lovász proved the (little) Perfect Graph Theorem, that the complement of every perfect graph is perfect. Another theorem from this paper links normal hypergraphs and perfect graphs. Perhaps this discussion will help someone avoid unnecessary grey hairs.

New ACC circuit lower bounds

Ryan Williams recently published a draft proving new lower bounds for ACC circuits. ACC (often known as ACC⁰) is the class of constant depth circuits with unbounded fan-in gates, where the usual AND/OR/NOT gates are supplemented by MOD_m gates for some constant m.

deterministic 3SAT in O*(1.334^n) time

Robin Moser and Dominik Scheder have put an end to the stream of slight improvements in derandomizing Schöning’s randomized k-SAT algorithm from 1999.

Deolalikar’s manuscript

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”).

FOCS 2010 accepted papers

The FOCS 2010 accepted papers were announced a few days ago. This is a quick summary of a few papers that caught my eye.

CCC 2010

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