Chris Calabro, Ph.D. - Publications
Affiliations: | 2009 | Computer Science and Engineering | University of California, San Diego, La Jolla, CA |
Area:
Computer ScienceYear | Citation | Score | |||
---|---|---|---|---|---|
2010 | Calabro C, Impagliazzo R, Paturi R. 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. DOI: 10.1007/S00453-012-9648-0 | 0.73 | |||
2009 | Calabro C, Impagliazzo R, Paturi R. 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. DOI: 10.1007/978-3-642-11269-0_6 | 0.571 | |||
2009 | Calabro C, Paturi R. 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. DOI: 10.1007/978-3-642-03351-3_8 | 0.717 | |||
2006 | Calabro C, Impagliazzo R, Paturi R. A duality between clause width and clause density for SAT Proceedings of the Annual Ieee Conference On Computational Complexity. 2006: 252-258. DOI: 10.1109/CCC.2006.6 | 0.728 | |||
2003 | Calabro C, Impagliazzo R, Kabanets V, Paturi R. The complexity of unique k-SAT: An isolation lemma for k-CNFs Proceedings of the Annual Ieee Conference On Computational Complexity. 135-141. DOI: 10.1016/J.Jcss.2007.06.015 | 0.728 | |||
2003 | Calabro C, Impagliazzo R, Kabanets V, Paturi R. The complexity of unique k-SAT: An isolation lemma for k-CNFs Proceedings of the Annual Ieee Conference On Computational Complexity. 135-141. | 0.743 | |||
Show low-probability matches. |