A Complete Dichotomy Rises from the Capture of Vanishing Signatures
- Submitting institution
-
University of Edinburgh
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 58557061
- Type
- D - Journal article
- DOI
-
10.1137/15M1049798
- Title of journal
- SIAM Journal on Computing
- Article number
- -
- First page
- 1671
- Volume
- 45
- Issue
- 5
- ISSN
- 0097-5397
- Open access status
- Deposit exception
- Month of publication
- September
- Year of publication
- 2016
- 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
-
2
- Research group(s)
-
C - Foundations of Computation
- Citation count
- 9
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Holant problems is an important class of problems studied in computational complexity. It is a natural generalization of constraint satisfaction problems. This paper is the culmination result over a long line of research spanned over a decade and is the first full complexity classification of these problems without any additional assumptions. Thus it provides a complete understanding of its complexity landscape. This paper became the starting point of a number of follow-up results. It also lead to new connections between Holant problems and quantum information theory. This paper is published in the prestigious journal SIAM J. Comput.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -