Definable inapproximability: New challenges for duplicator
- Submitting institution
-
University of Cambridge
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 12772
- Type
- D - Journal article
- DOI
-
10.1093/logcom/exz022
- Title of journal
- Journal of Logic and Computation
- Article number
- 8
- First page
- 1185
- Volume
- 29
- Issue
- 8
- ISSN
- 0955-792X
- Open access status
- Compliant
- Month of publication
- December
- Year of publication
- 2019
- URL
-
-
- 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)
-
-
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The hardness of approximation of NP-hard optimisation problems has been a major topic of research in complexity theory since the PCP theorem in the early 90s. This paper strikes out a new direction by showing unconditional hardness results in the context of definability. It offers a rigorous explanation of why many standard algorithmic techniques such as those based on linear programming are unable to approximate hard problems.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -