Searcharxiv⌕ Search

arXiv · cs/9907036

Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP

Abstract

In 1876, Lewis Carroll proposed a voting system in which the winner is the candidate who with the fewest changes in voters' preferences becomes a Condorcet winner---a candidate who beats all other candidates in pairwise majority-rule elections. Bartholdi, Tovey, and Trick provided a lower bound---NP-hardness---on the computational complexity of determining the election winner in Carroll's system. We provide a stronger lower bound and an upper bound that matches our lower bound. In particular, determining the winner in Carroll's system is complete for parallel access to NP, i.e., it is complete for $\thetatwo$, for which it becomes the most natural complete problem known. It follows that determining the winner in Carroll's elections is not NP-complete unless the polynomial hierarchy collapses.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Edith Hemaspaandra, Lane A. Hemaspaandra, Joerg Rothe. 1999-07-25. Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP. https://searcharxiv.com/abs/cs/9907036

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Random Clocks on Computation Paths: How Far Can They Reach, and When Does Stepping Back Help?

A lookup, a prediction, or a return to a saved state can bring us to a stage of a computation without replaying the intervening steps. We model this access by a random clock, fixed in advance, that moves along a deterministic computation by jumping forward or stepping backward. Each observation costs one unit. We ask which language classes can be recognized with polynomially many observations. For clocks with independent jumps, the resulting class depends primarily on the tail of the forward-jump distribution. We give explicit clocks that recognize exactly $\mathrm{EXP}$, $\mathrm{2EXP}$, and each quasipolynomial class $\mathrm{QP}_k$, with the latter forming a strict hierarchy between $\mathrm{P}$ and $\mathrm{EXP}$. A backward-drifting clock with sufficiently rare long forward jumps recognizes exactly the reverse-definite languages, whose membership is determined by a bounded prefix of the input. Between the reverse-definite languages and $\mathrm{P}$, we construct infinitely many pairwise incomparable classes. Finally, we construct families in which every forward-only clock recognizes only languages in $\mathrm{P}$, while allowing occasional one-step backward moves yields $\mathrm{EXP}$ and larger classes.

cs.CC↗

Inapproximability of L1->L2 Subspace Distortion

We show, assuming NP is not contained in randomized quasipolynomial time, almost polynomial factor inapproximability for maximizing the $\ell_2/\ell_1$ ratio over a real subspace -- a problem also known as subspace distortion. This is a central problem in compressed sensing but also has connections to many areas such as real error correcting codes, dictionary learning, hypercontractive operator norms, small-set expansion, quantum information and random matrix theory. Distortion seems to be at the heart of building inapproximability theory for continuous optimization. Extending our results to the case of $\ell_2/\ell_p$ for all $p<2$ would lead to a near characterization of the convex sets over which one can efficiently and approximately maximize an arbitrary quadratic form. A recurring obstruction appears in hardness considerations of distortion -- how does one use a sparsity measure to test proximity to an exponential sized discrete set over the reals? This issue also appears in a host of other problems that involve measures of sparsity, shortness, density or expansion. We believe hardness of distortion is an intermediate step to understanding the complexity of small-set expansion and quantum separability, both of which are important directions of research. The main insight in our hardness reduction is the construction of a randomized affine linear map $T:\mathbb{R}^n\to \mathbb{R}^m$ such that the distortion of $Tx$ measures proximity to the hypercube $\{\pm 1\}^{n}$. Crucial to our construction is subsampling $x$ at *all* dyadic sample sizes, which gives an inverse polylogarithmic gap. This is a highly non-local tester, and thus departs from the local testing paradigm in PCP theory. Our reduction is also quite succinct, and so it suggests a rather simple distribution of subspaces for which approximately finding a planted sparse vector is intractable.

cs.CC↗

A Dichotomy for Exact Quantum Circuit Amplitudes

We classify the complexity of exactly computing computational-basis amplitudes for circuits over any fixed finite library of unitary qubit gates, with each gate allowed to act on any ordered tuple of distinct wires. Exact evaluation is polynomial-time computable if all gates permute the computational basis up to phases, all preserve product states, or all become Clifford under a common diagonal one-qubit unitary change of basis on every wire. For every other library, the problem is $\#\mathrm P$-hard under polynomial-time Turing reductions. Our proof connects circuit amplitudes to the Boolean Holant classification of tensor contractions on arbitrary graphs. For an algebraic library containing a nonmonomial gate and an entangling gate, we show how to simulate the joint use of a symmetric maximally entangled state and its adjoint at polynomial cost, using only amplitude queries over the original library. This lets us evaluate unrestricted contractions of the resulting gate and boundary tensors. Unitarity and the computational-basis boundaries then restrict the tractable cases to the three forms above. Algebraic specialization extends the dichotomy to arbitrary fixed complex gate entries under a symbolic exact-output convention.

cs.CC↗