Chris Calabro
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| On the exact complexity of evaluating quantified \(k\)-\textsc{cnf} Algorithmica | 2013-05-16 | Paper |
| On the exact complexity of evaluating quantified k-CNF Parameterized and Exact Computation | 2010-12-07 | Paper |
| The complexity of satisfiability of small depth circuits Parameterized and Exact Computation | 2010-01-14 | Paper |
| k-SAT Is No Harder Than Decision-Unique-k-SAT Computer Science - Theory and Applications | 2009-08-18 | Paper |
| The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs Journal of Computer and System Sciences | 2008-03-11 | Paper |
Research outcomes over time
This page was built for person: Chris Calabro
