Pages that link to "Item:Q2986797"
From MaRDI portal
The following pages link to Decomposing Quantified Conjunctive (or Disjunctive) Formulas (Q2986797):
Displaying 13 items.
- Structural tractability of counting of solutions to conjunctive queries (Q269342) (← links)
- The complexity of weighted counting for acyclic conjunctive queries (Q395018) (← links)
- On the shortest path game (Q729795) (← links)
- Characterizing tractability of simple well-designed pattern trees with projection (Q2035467) (← links)
- Using decomposition-parameters for QBF: mind the prefix! (Q2304627) (← links)
- Bounded-width QBF is PSPACE-complete (Q2453562) (← links)
- Using binary patterns for counting falsifying assignments of conjunctive forms (Q2520658) (← links)
- Quantified conjunctive queries on partially ordered sets (Q2634671) (← links)
- Quantified Conjunctive Queries on Partially Ordered Sets (Q2946013) (← links)
- Quantified Constraints in Twenty Seventeen (Q4993605) (← links)
- (Q5091134) (← links)
- On the complexity of existential positive queries (Q5410336) (← links)
- Decomposing Quantified Conjunctive (or Disjunctive) Formulas (Q5506695) (← links)