1 citations · 1 across the 3 of their papers we have counts for
4 papers
Linked Fates: How Small of an Ambiguity Increase Can Make the Difference Between Equaling and Separating from P?
Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra +3
Ambiguity-bounded versions of , denoted , bound by the number of accepting paths the nondeterministic polynomial-time Turing machine ca…
Search versus Search for Collapsing Electoral Control Types
Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra +3
Electoral control types are ways of trying to change the outcome of elections by altering aspects of their composition and structure [BTT92]. We say two compatible (i.e., having th…
Separating and Collapsing Electoral Control Types
Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra +3
[HHM20] discovered, for 7 pairs (C,D) of seemingly distinct standard electoral control types, that C and D are identical: For each input I and each election system, I is a Yes inst…
A Critique of Keum-Bae Cho's Proof that
Benjamin Carleton, Michael C. Chavrimootoo, Conor Taliancich
In this paper we critique Keum-Bae Cho's proof that . This proof relates instances of 3-SAT to indistinguishable binomial decision trees and clai…