Constant-Query Testability of Assignments to Constraint Satisfaction Problems

For each finite relational structure $A$, let $CSP(A)$ denote the CSP instances whose constraint relations are taken from $A$. The resulting family of problems $CSP(A)$ has been considered heavily ...

Paper

Full text

PDF

Constant-Query Testability of Assignments to Constraint Satisfaction Problems

Semantic Scholar · Computer Science · 2019

Abstract

For each finite relational structure $A$, let $CSP(A)$ denote the CSP instances whose constraint relations are taken from $A$. The resulting family of problems $CSP(A)$ has been considered heavily ...

Similar papers

© 2026 NYSGPT2525 LLC