Pages that link to "Item:Q5714771"
From MaRDI portal
The following pages link to Theory and Applications of Satisfiability Testing (Q5714771):
Displaying 12 items.
- Tractable counting of the answers to conjunctive queries (Q389242) (← links)
- The complexity of weighted counting for acyclic conjunctive queries (Q395018) (← links)
- Enumeration complexity of conjunctive queries with functional dependencies (Q778529) (← links)
- A more general theory of static approximations for conjunctive queries (Q778535) (← links)
- Computational complexity of auditing finite attributes in statistical databases (Q931731) (← links)
- Conjunctive-query containment and constraint satisfaction (Q1591157) (← links)
- Near-optimal computation of runs over general alphabet via non-crossing LCE queries (Q1796824) (← links)
- The complexity of problems for quantified constraints (Q1959381) (← links)
- Efficient Approximations of Conjunctive Queries (Q3190694) (← links)
- The complexity of acyclic conjunctive queries (Q3196620) (← links)
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)
- How to tell easy from hard: complexities of conjunctive query entailment in extensions of \(\mathcal{ALC}\) (Q6535408) (← links)