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...
| Main Authors: | , |
|---|---|
| Formato: | Conference item |
| Idioma: | English |
| Publicado em: |
Association for Computing Machinery
2019
|