Michael C. Chavrimootoo

According to our database, Michael C. Chavrimootoo authored at least 16 papers between 2021 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

The Cost of Failure: On The Complexity of Recampaigning under Fixed Districts.

Michael C. Chavrimootoo, Aidan Jeansonne

CoRR, January, 2026

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

CoRR, January, 2026

2025

Approximating Electoral Control Problems.

Huy Vu Bui, Michael C. Chavrimootoo, Trung Kien Le, Son M. Nguyen

CoRR, September, 2025

Defying gravity and gadget numerosity: The complexity of the Hanano Puzzle and beyond.

Michael C. Chavrimootoo

Inf. Process. Lett., 2025

2024

A Brief Note on a Recent Claim About NP-Hard Problems and BQP.

Michael C. Chavrimootoo

CoRR, 2024

Search Versus Search for Collapsing Electoral Control Types.

Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra, David E. Narváez, Conor Taliancich, Henry B. Welles

Proceedings of the Multi-Agent Systems - 21st European Conference, 2024

2023

On Czerwinski's "P ≠ NP relative to a P-complete oracle".

Michael C. Chavrimootoo, Tran Duy Anh Le, Michael P. Reidy, Eliot J. Smith

CoRR, 2023

Evaluating the Claims of "SAT Requires Exhaustive Search".

Michael C. Chavrimootoo, Yumeng He, Matan Kotler-Berkowitz, Harry Liuson, Zeyu Nie

CoRR, 2023

A Critique of Sopin's "PH = PSPACE".

Michael C. Chavrimootoo, Ian Clingerman, Quan Luu

CoRR, 2023

Defying Gravity and Gadget Numerosity: The Complexity of the Hanano Puzzle.

Michael C. Chavrimootoo

Proceedings of the Descriptional Complexity of Formal Systems, 2023

Separations and Collapses in Computational Social Choice.

Michael C. Chavrimootoo

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Separating and Collapsing Electoral Control Types.

Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra, David E. Narváez, Conor Taliancich, Henry B. Welles

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022

A Closer Look at Some Recent Proof Compression-Related Claims.

Michael C. Chavrimootoo, Ethan Ferland, Erin Gibson, Ashley H. Wilson

CoRR, 2022

Defying Gravity: On the Complexity of the Hanano Puzzle.

Michael C. Chavrimootoo

CoRR, 2022

2021

A Critique of Kumar's "Necessary and Sufficient Condition for Satisfiability of a Boolean Formula in CNF and Its Implications on P versus NP problem.".

Michael C. Chavrimootoo, Henry B. Welles

CoRR, 2021

A Critique of Keum-Bae Cho's Proof that P ⊊ NP.

Benjamin Carleton, Michael C. Chavrimootoo, Conor Taliancich

CoRR, 2021