The following pages link to On the Power of k-Consistency (Q5428816):
Displaying 16 items.
- On the consistency of consistent conjectures (Q374974) (← links)
- Tree projections and structural decomposition methods: minimality and game-theoretic characterization (Q393903) (← links)
- On singleton arc consistency for CSPs defined by monotone patterns (Q1739115) (← links)
- How many variables are needed to express an existential positive query? (Q2322719) (← links)
- On the hardness of solving edge matching puzzles as SAT or CSP problems (Q2342584) (← links)
- Structural tractability of enumerating CSP solutions (Q2342585) (← links)
- On the speed of constraint propagation and the time complexity of arc consistency testing (Q2409578) (← links)
- A quasi-lower bound on the consistency strength of PFA (Q3190409) (← links)
- On Singleton Arc Consistency for CSPs Defined by Monotone Patterns (Q3304113) (← links)
- Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems (Q3644743) (← links)
- Tree Projections: Game Characterization and Computational Aspects (Q3655155) (← links)
- The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side (Q5026391) (← links)
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems (Q5283239) (← links)
- Uniform Constraint Satisfaction Problems and Database Theory (Q5504703) (← links)
- On Monotonic Determinacy and Rewritability for Recursive Queries and Views (Q5886523) (← links)
- Collapsing the bounded width hierarchy for infinite-domain constraint satisfaction problems: when symmetries are enough (Q6654559) (← links)
