The following pages link to Stefan Mengel (Q269341):
Displaying 37 items.
- Structural tractability of counting of solutions to conjunctive queries (Q269342) (← links)
- The arithmetic complexity of tensor contraction (Q290898) (← links)
- The complexity of weighted counting for acyclic conjunctive queries (Q395018) (← links)
- QBF as an alternative to Courcelle's theorem (Q1656581) (← links)
- On the relative power of reduction notions in arithmetic circuit complexity (Q1679901) (← links)
- Characterizing tractability of simple well-designed pattern trees with projection (Q2035467) (← links)
- Characterizing Tseitin-formulas with short regular resolution refutations (Q2118291) (← links)
- Proof complexity of symbolic QBF reasoning (Q2118330) (← links)
- Revisiting graph width measures for CNF-encodings (Q2181934) (← links)
- Minimal distance of propositional models (Q2322705) (← links)
- Monomials in arithmetic circuits: complete problems in the counting hierarchy (Q2353185) (← links)
- Lower bounds on the mim-width of some graph classes (Q2413964) (← links)
- As Close as It Gets (Q2803825) (← links)
- Parameterized Compilation Lower Bounds for Restricted CNF-Formulas (Q2817997) (← links)
- Arithmetic Branching Programs with Memory (Q2849952) (← links)
- (Q2904776) (← links)
- (Q2954991) (← links)
- The arithmetic complexity of tensor contractions (Q2957898) (← links)
- Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems (Q3012844) (← links)
- Hypergraph Acyclicity and Propositional Model Counting (Q3192085) (← links)
- (Q3305348) (← links)
- On Compiling CNFs into Structured Deterministic DNNFs (Q3453225) (← links)
- Give Me Another One! (Q3459903) (← links)
- No Efficient Disjunction or Conjunction of Switch-Lists (Q5080958) (← links)
- (Q5090465) (← links)
- (Q5091134) (← links)
- (Q5091137) (← links)
- Revisiting Graph Width Measures for CNF-Encodings (Q5109896) (← links)
- (Q5111443) (← links)
- (Q5144631) (← links)
- A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries (Q5738928) (← links)
- The Next Whisky Bar (Q5740176) (← links)
- Characterizing Tseitin-Formulas with Short Regular Resolution Refutations (Q5881799) (← links)
- Changing partitions in rectangle decision lists (Q6572030) (← links)
- An extended knowledge compilation map for conditional preference statements-based and generalized additive utilities-based languages (Q6630721) (← links)
- Bounds on BDD-based bucket elimination (Q6643092) (← links)
- Sum of Squares Circuits (Q6741270) (← links)
