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...
Príomhchruthaitheoirí: | Filos-Ratsikas, A, Goldberg, PW |
---|---|
Formáid: | Conference item |
Teanga: | English |
Foilsithe / Cruthaithe: |
Association for Computing Machinery
2019
|
Míreanna comhchosúla
-
The complexity of splitting necklaces and bisecting ham sandwiches
de réir: Filos-Ratsikas, A, et al.
Foilsithe / Cruthaithe: (2019) -
The complexity of necklace splitting, consensus-halving, and discrete ham sandwich
de réir: Filos-Ratsikas, A, et al.
Foilsithe / Cruthaithe: (2022) -
Dynamic ham-sandwich cuts in the plane
de réir: Abbott, Timothy G., et al.
Foilsithe / Cruthaithe: (2015) -
On Bisecting Random Graphs
de réir: Bui, Thang Nguyen
Foilsithe / Cruthaithe: (2023) -
Graph bisection algorithms
de réir: Bui, Thang Nguyen
Foilsithe / Cruthaithe: (2013)