Chris Calabro, Ph.D.
Affiliations: | 2009 | Computer Science and Engineering | University of California, San Diego, La Jolla, CA |
Area:
Computer ScienceGoogle:
"Chris Calabro"Parents
Sign in to add mentor| Ramamohan Paturi | grad student | 2009 | UCSD | |
| (The exponential complexity of satisfiability problems.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Calabro C, Impagliazzo R, Paturi R. (2010) On the exact complexity of evaluating quantified k-CNF Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6478: 50-59 |
| Calabro C, Impagliazzo R, Paturi R. (2009) The complexity of satisfiability of small depth circuits Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5917: 75-85 |
| Calabro C, Paturi R. (2009) K-SAT is no harder than decision-unique-k-SAT Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5675: 59-70 |
| Calabro C, Impagliazzo R, Paturi R. (2006) A duality between clause width and clause density for SAT Proceedings of the Annual Ieee Conference On Computational Complexity. 2006: 252-258 |
| Calabro C, Impagliazzo R, Kabanets V, et al. (2003) The complexity of unique k-SAT: An isolation lemma for k-CNFs Proceedings of the Annual Ieee Conference On Computational Complexity. 135-141 |
| Calabro C, Impagliazzo R, Kabanets V, et al. (2003) The complexity of unique k-SAT: An isolation lemma for k-CNFs Proceedings of the Annual Ieee Conference On Computational Complexity. 135-141 |