Constant-query testability of assignments to constraint satisfaction problems
- Submitting institution
-
Birkbeck College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 149
- Type
- D - Journal article
- DOI
-
-
- Title of journal
- SIAM Journal on Computing
- Article number
- -
- First page
- 1022
- Volume
- 48
- Issue
- 3
- ISSN
- 1095-7111
- Open access status
- Compliant
- Month of publication
- May
- Year of publication
- 2019
- URL
-
http://eprints.bbk.ac.uk/id/eprint/27754/
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
3 - Knowledge Representation and Data Management
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This article characterises completely the constraint satisfaction problems where satisfiability of assignments is constant-query testable, generalising and unifying a number of previous results. The article served as inspiration for the 2019 PODS article by H. Chen and Y. Yoshida, which presented a complete classification of the conjunctive queries defining properties that are constant-query testable (in a natural model made precise in that article).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -