ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1805.12559
55
44
v1v2 (latest)

The Complexity of Splitting Necklaces and Bisecting Ham Sandwiches

31 May 2018
Aris Filos-Ratsikas
Paul W. Goldberg
ArXiv (abs)PDFHTML
Abstract

We resolve the computational complexity of two problems known as NECKLACE-SPLITTING and DISCRETE HAM SANDWICH, showing that they are PPA-complete. We do this via a PPA-completeness result for an approximate version of the CONSENSUS-HALVING problem, strengthening our recent result that the problem is PPA-complete for inverse-exponential precision. At the heart of our construction is a smooth embedding of the high-dimensional M\"{o}bius strip in the CONSENSUS-HALVING problem. These results settle the status of PPA as a class that captures the complexity of "natural'" problems whose definitions do not incorporate a circuit.

View on arXiv
Comments on this paper