| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection | Mengel, Stefan et al. | 2019 |
| 2 | Constant-Delay Enumeration for Nondeterministic Document Spanners | Amarilli, Antoine et al. | 2019 |
| 3 | Tractable QBF by Knowledge Compilation | Capelli, Florent et al. | 2019 |
| 4 | Enumeration on Trees under Relabelings | Amarilli, Antoine et al. | 2018 |
| 5 | A Circuit-Based Approach to Efficient Enumeration | Amarilli, Antoine et al. | 2017 |
| 6 | A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries | Chen, Hubie et al. | 2015 |
| 7 | Understanding Model Counting for beta-acyclic CNF-formulas | Brault-Baron, Johann et al. | 2015 |
| 8 | The arithmetic complexity of tensor contractions | Capelli, Florent et al. | 2013 |
| 9 | Monomials in arithmetic circuits: Complete problems in the counting hierarchy | Fournier, Hervé et al. | 2012 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 9 |