6 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…
Axiomatic Tools for Separating Electoral Control Types, with Applications to Concrete Systems
Michael C. Chavrimootoo, Ian Clingerman, Ethan Ferland +5
Electoral control is the study of whether an attacker, by structural changes on an election such as adding/deleting/partitioning voters or candidates, can affect the winner in some…
The Cost of Failure: On The Complexity of Recampaigning under Fixed Districts
Michael C. Chavrimootoo, Aidan Jeansonne
Redistricting efforts have gathered contemporary attention in both popular and scholarly debates, particularly in the United States where efforts to redraw congressional districts…
Carrying is Hard: Exploring the Gap between Hardness for NP and PSPACE for the Hanano and Jelly no Puzzles
Michael C. Chavrimootoo, Jin Seok Youn
The Hanano Puzzle is a one-player game with gravity, where the goal is to make colored blocks make contact with flowers of the corresponding color. The game Jelly no Puzzle shares…
Approximating Electoral Control Problems
Huy Vu Bui, Michael C. Chavrimootoo, Kien T. Le +1
Much research in electoral control---one of the most studied form of electoral attacks, in which an entity running an election alters the structure of that election to yield a pref…
A Brief Note on a Recent Claim About NP-Hard Problems and BQP
Michael C. Chavrimootoo
This short note outlines some of the issues in Czerwinski's paper [Cze23] claiming that NP-hard problems are not in BQP. We outline one major issue and two minor issues, and conclu…