| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Sparsification Lower Bounds for List H-Coloring | Chen, Hubie et al. | 2020 |
| 2 | Best-Case and Worst-Case Sparsifiability of Boolean CSPs | Chen, Hubie et al. | 2019 |
| 3 | How Many Variables Are Needed to Express an Existential Positive Query? | Bova, Simone et al. | 2017 |
| 4 | Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness | Chen, Hubie | 2016 |
| 5 | Quantified Constraint Satisfaction on Monoids | Chen, Hubie et al. | 2016 |
| 6 | A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries | Chen, Hubie et al. | 2015 |
| 7 | Parameter Compilation | Chen, Hubie | 2015 |
| 8 | On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas | Valeriote, Matt et al. | 2010 |
| 9 | Constraint Satisfaction with Succinctly Specified Relations | Chen, Hubie et al. | 2006 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 9 |