The complexity of splitting necklaces and bisecting ham sandwiches
We resolve the computational complexity of two problems known as Necklace-splitting and Discrete Ham Sandwich showing that they are PPA-complete. For Necklace-splitting, this result is specific to the important special case in which two thieves share the necklace. We do this via a PPA-completeness r...
Glavni autori: | Filos-Ratsikas, A, Goldberg, PW |
---|---|
Format: | Conference item |
Jezik: | English |
Izdano: |
Association for Computing Machinery
2019
|
Slični predmeti
-
The complexity of splitting necklaces and bisecting ham sandwiches
od: Filos-Ratsikas, A, i dr.
Izdano: (2019) -
The complexity of necklace splitting, consensus-halving, and discrete ham sandwich
od: Filos-Ratsikas, A, i dr.
Izdano: (2022) -
Dynamic ham-sandwich cuts in the plane
od: Abbott, Timothy G., i dr.
Izdano: (2015) -
On Bisecting Random Graphs
od: Bui, Thang Nguyen
Izdano: (2023) -
Graph bisection algorithms
od: Bui, Thang Nguyen
Izdano: (2013)