The Structure of Tractable Constraint Satisfaction Problems
From MaRDI portal
Cited in
(17)- scientific article; zbMATH DE number 2084702 (Why is no real title available?)
- Tractability in constraint satisfaction problems: a survey
- Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination
- Complexity and approximability of parameterized MAX-CSPs
- Linear Programs with Conjunctive Database Queries
- Tractable structures for constraint satisfaction with truth tables
- Time complexity of constraint satisfaction via universal algebra
- Recent Advances in Constraints
- On the parallel parameterized complexity of MaxSAT variants
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems
- The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems
- scientific article; zbMATH DE number 1322793 (Why is no real title available?)
- Recognition of tractable satisfiability problems through balanced polynomial representations
- The TPTP problem library. CNF release v1. 2. 1
- Computational complexity of auditing finite attributes in statistical databases
- Tractable Optimization Problems through Hypergraph-Based Structural Restrictions
- On the power of structural decompositions of graph-based representations of constraint problems
This page was built for publication: The Structure of Tractable Constraint Satisfaction Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756665)
