 | 2010 |
|---|
| 7 |       | Chris Calabro,
Russell Impagliazzo,
Ramamohan Paturi:
On the Exact Complexity of Evaluating Quantified k-CNF.
IPEC 2010: 50-59 |
| 2009 |
|---|
| 6 | | Chris Calabro,
Ramamohan Paturi:
k-SAT Is No Harder Than Decision-Unique-k-SAT.
CSR 2009: 59-70 |
| 5 | | Chris Calabro,
Russell Impagliazzo,
Ramamohan Paturi:
The Complexity of Satisfiability of Small Depth Circuits.
IWPEC 2009: 75-85 |
| 2008 |
|---|
| 4 | | 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 | | 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 | | 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 | | 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- |
Data released under the ODC-BY 1.0 license — See also our legal information page