The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich
Work
Year: 2022
Type: article
Abstract: We resolve the computational complexity of three problems known as Necklace Splitting, Consensus-Halving, and Discrete Ham sandwich, showing that they are PPA-complete. For NECKLACE SPLITTING, this re... more
Source: SIAM Journal on Computing
Authors Aris Filos-Ratsikas, Paul W. Goldberg
Cites: 62
Cited by: 8
Related to: 10
FWCI: 1.446
Citation percentile (by year/subfield): 99.99
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green