Chris Calabro

The Complexity of Satisfiability of Small Depth Circuits

Russell Impagliazzo, Chris Calabro, Ramamohan Paturi, 2009, IWPEC.

A duality between clause width and clause density for SAT

Russell Impagliazzo, Chris Calabro, Ramamohan Paturi, 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

The complexity of unique k-SAT: an isolation lemma for k-CNFs

Russell Impagliazzo, Chris Calabro, Valentine Kabanets, 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

On the Exact Complexity of Evaluating Quantified k-CNF

Russell Impagliazzo, Chris Calabro, Ramamohan Paturi, 2010, Algorithmica.

The exponential complexity of satisfiability problems

Chris Calabro, Chris Calabro, 2009 .