Determining a Slater Winner is Complete for Parallel Access to NP

Michael Lampis

Home/Archive/arXiv

arXiv · 2103.16416

Determining a Slater Winner is Complete for Parallel Access to NP

Michael Lampis

View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider the complexity of deciding the winner of an election under the Slater rule. In this setting we are given a tournament $T = (V, A)$, where the vertices of V represent candidates and the direction of each arc indicates which of the two endpoints is preferable for the majority of voters. The Slater score of a vertex $v\in V$ is defined as the minimum number of arcs that need to be reversed so that $T$ becomes acyclic and $v$ becomes the winner. We say that $v$ is a Slater winner in $T$ if $v$ has minimum Slater score in $T$. Deciding if a vertex is a Slater winner in a tournament has long been known to be NP-hard. However, the best known complexity upper bound for this problem is the class $\Theta_2^p$, which corresponds to polynomial-time Turing machines with parallel access to an NP oracle. In this paper we close this gap by showing that the problem is $\Theta_2^p$-complete, and that this hardness applies to instances constructible by aggregating the preferences of 7 voters.

Explore related subjects

cs.CC

Keep this discovery

BibTeX RIS

Michael Lampis. 2021-03-30. Determining a Slater Winner is Complete for Parallel Access to NP. https://arxiv.org/abs/2103.16416

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗

arXiv2026

Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor

We show that there is a fixed planar graph $H$, namely the $5 \times 5$ grid, such that Max Independent Set remains NP-hard in $H$-induced-minor-free graphs. This refutes the Dallard--Milani\v{c}--\v{S}torgel conjecture and a weakening of it by Gartland and Lokshtanov, and by Korhonen.

cs.CC↗

arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗