QCSP monsters and the demise of the chen conjecture
- Submitting institution
-
University of Durham
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 130644
- Type
- E - Conference contribution
- DOI
-
10.1145/3357713.3384232
- Title of conference / published proceedings
- 52nd Annual ACM SIGACT Symposium on Theory of Computing
- First page
- 91
- Volume
- -
- Issue
- -
- ISSN
- 07378017
- Open access status
- Compliant
- Month of publication
- -
- Year of publication
- 2020
- URL
-
https://doi.org/10.1145/3357713.3384232
- 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
-
1
- Research group(s)
-
B - Algorithms and Complexity
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Forces complete re-evaluation of computational complexity landscape among finite-domain QCSPs by showing some problems exhibit exotic complexity: DP-complete, Theta^P_2-complete. Classes such as these do not appear anywhere else in computational complexity landscape of syntactic fragments of first-order logic as in "On the Complexity of the Model Checking Problem" (SIAM J. Comput.: 10.1137/140965715). At the same time refutes the widely-believe Chen Conjecture (from "Meditations on Quantified Constraint Satisfaction": 10.1007/978-3-642-29485-3\_4) on the complexity of finite-domain QCSPs.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -