Pages that link to "Item:Q5738928"
From MaRDI portal
The following pages link to A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries (Q5738928):
Displaying 10 items.
- Solving projected model counting by utilizing treewidth and its limits (Q2680775) (← links)
- (Q3305351) (← links)
- (Q5009461) (← links)
- The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side (Q5026391) (← links)
- Counting Small Induced Subgraphs Satisfying Monotone Properties (Q5071087) (← links)
- Counting Answers to Existential Questions (Q5091275) (← links)
- Decomposing Quantified Conjunctive (or Disjunctive) Formulas (Q5506695) (← links)
- Parameterised complexity of model checking and satisfiability in propositional dependence logic (Q5918486) (← links)
- The smallest hard trees (Q6073305) (← links)
- Answer Counting under Guarded TGDs (Q6076172) (← links)
