Consensus Halving Is PPA-Complete
- Submitting institution
-
The University of Liverpool
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 12186
- Type
- E - Conference contribution
- DOI
-
10.1145/3188745.3188880
- Title of conference / published proceedings
- STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING
- First page
- 51
- Volume
- -
- Issue
- -
- ISSN
- 0737-8017
- Open access status
- Technical exception
- Month of publication
- June
- Year of publication
- 2018
- 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
- 7
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Papadimitriou defined the complexity class PPA in 1994. This paper identifies Consensus Halving, a well-known problem from computational social choice, as the first natural problem that is complete for PPA.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -