Michael C. Chavrimootoo

Orcid: 0000-0002-0510-6002

According to our database1, Michael C. Chavrimootoo authored at least 13 papers between 2021 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Defying gravity and gadget numerosity: The complexity of the Hanano Puzzle and beyond.
Inf. Process. Lett., 2025

2024
Separating and Collapsing Electoral Control Types.
J. Artif. Intell. Res., 2024

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

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

Evaluating the Claims of "SAT Requires Exhaustive Search".
CoRR, 2023

A Critique of Sopin's "PH = PSPACE".
CoRR, 2023

Defying Gravity and Gadget Numerosity: The Complexity of the Hanano Puzzle.
Proceedings of the Descriptional Complexity of Formal Systems, 2023

Separations and Collapses in Computational Social Choice.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Search versus Search for Collapsing Electoral Control Types.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

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

Defying Gravity: On the Complexity of the Hanano Puzzle.
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.".
CoRR, 2021

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


  Loading...