BIROn - Birkbeck Institutional Research Online

    Constant-query testability of assignments to constraint satisfaction problems

    Chen, Hubie and Valeriote, M. and Yoshida, Y. (2019) Constant-query testability of assignments to constraint satisfaction problems. SIAM Journal on Computing 48 (3), pp. 1022-1045. ISSN 1095-7111.

    main.pdf - Author's Accepted Manuscript

    Download (880kB) | Preview


    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 in a variety of computational contexts. In this article, we consider this family from the perspective of property testing: given a CSP instance and query access to an assignment, one wants to decide whether the assignment satisfies the instance or is far from doing so. While previous work on this scenario studied concrete templates or restricted classes of structures, this article presents a comprehensive classification theorem. Our main contribution is a dichotomy theorem completely characterizing the finite structures $A$ such that $CSP(A)$ is constant-query testable: (i) If $A$ has a majority polymorphism and a Maltsev polymorphism, then $CSP(A)$ is constant-query testable with one-sided error. (ii) Otherwise, testing $CSP(A)$ requires a superconstant number of queries.


    Item Type: Article
    Keyword(s) / Subject(s): constraint satisfaction problems, property testing, massively parameterized model
    School: Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
    Depositing User: Hubie Chen
    Date Deposited: 10 Jun 2019 09:38
    Last Modified: 09 Aug 2023 12:46


    Activity Overview
    6 month trend
    6 month trend

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item