| 2008 |
|---|
| 4 | EE | Chris Calabro:
A Lower Bound on the Size of Series-Parallel Graphs Dense in Long Paths.
Electronic Colloquium on Computational Complexity (ECCC) 15(110): (2008) |
| 3 | EE | Chris Calabro,
Russell Impagliazzo,
Valentine Kabanets,
Ramamohan Paturi:
The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs.
J. Comput. Syst. Sci. 74(3): 386-393 (2008) |
| 2006 |
|---|
| 2 | EE | Chris Calabro,
Russell Impagliazzo,
Ramamohan Paturi:
A Duality between Clause Width and Clause Density for SAT.
IEEE Conference on Computational Complexity 2006: 252-260 |
| 2003 |
|---|
| 1 | EE | Chris Calabro,
Russell Impagliazzo,
Valentine Kabanets,
Ramamohan Paturi:
The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs.
IEEE Conference on Computational Complexity 2003: 135- |
