No. Title Author Year
1 Bounds on BDD-Based Bucket Elimination Mengel, Stefan 2023
2 Changing Partitions in Rectangle Decision Lists Mengel, Stefan 2022
3 Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection Mengel, Stefan et al. 2019
4 Constant-Delay Enumeration for Nondeterministic Document Spanners Amarilli, Antoine et al. 2019
5 Tractable QBF by Knowledge Compilation Capelli, Florent et al. 2019
6 Enumeration on Trees under Relabelings Amarilli, Antoine et al. 2018
7 A Circuit-Based Approach to Efficient Enumeration Amarilli, Antoine et al. 2017
8 A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries Chen, Hubie et al. 2015
9 Understanding Model Counting for beta-acyclic CNF-formulas Brault-Baron, Johann et al. 2015
10 The arithmetic complexity of tensor contractions Capelli, Florent et al. 2013
11 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: 11

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI