Consensus Halving is PPA-Complete

11/13/2017
by   Aris Filos-Ratsikas, et al.
0

We show that the computational problem CONSENSUS-HALVING is PPA-complete, the first PPA-completeness result for a problem whose definition does not involve an explicit circuit. We also show that an approximate version of this problem is polynomial-time equivalent to NECKLACE SPLITTING, which establishes PPAD-hardness for NECKLACE SPLITTING, and suggests that it is also PPA-complete.

READ FULL TEXT

page 1

page 2

page 3

page 4

05/31/2018

The Complexity of Splitting Necklaces and Bisecting Ham Sandwiches

We resolve the computational complexity of two problems known as NECKLAC...
05/18/2021

Kemeny Consensus Complexity

The computational study of election problems generally focuses on questi...
03/07/2019

Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem

We study the problem of finding an exact solution to the consensus halvi...
08/05/2021

Geometric Embeddability of Complexes is ∃ℝ-complete

We show that the decision problem of determining whether a given (abstra...
02/26/2020

Consenus-Halving: Does it Ever Get Easier?

In the ε-Consensus-Halving problem, a fundamental problem in fair divisi...
02/26/2020

Consensus-Halving: Does it Ever Get Easier?

In the ε-Consensus-Halving problem, a fundamental problem in fair divisi...
01/24/2022

Constant Inapproximability for PPA

In the ε-Consensus-Halving problem, we are given n probability measures ...