
The Complexity of Splitting Necklaces and Bisecting Ham Sandwiches
We resolve the computational complexity of two problems known as NECKLAC...
read it

Kemeny Consensus Complexity
The computational study of election problems generally focuses on questi...
read it

Geometric Embeddability of Complexes is ∃ℝcomplete
We show that the decision problem of determining whether a given (abstra...
read it

ConsensusHalving: Does it Ever Get Easier?
In the εConsensusHalving problem, a fundamental problem in fair divisi...
read it

ConsenusHalving: Does it Ever Get Easier?
In the εConsensusHalving problem, a fundamental problem in fair divisi...
read it

Computing Exact Solutions of Consensus Halving and the BorsukUlam Theorem
We study the problem of finding an exact solution to the consensus halvi...
read it

Efficient Splitting of Measures and Necklaces
We provide approximation algorithms for two problems, known as NECKLACE ...
read it
Consensus Halving is PPAComplete
We show that the computational problem CONSENSUSHALVING is PPAcomplete, the first PPAcompleteness result for a problem whose definition does not involve an explicit circuit. We also show that an approximate version of this problem is polynomialtime equivalent to NECKLACE SPLITTING, which establishes PPADhardness for NECKLACE SPLITTING, and suggests that it is also PPAcomplete.
READ FULL TEXT
Comments
There are no comments yet.