\n \n \n
\n
\n\n \n \n \n \n \n \n On Czerwinski's ``P $\\neq$ NP relative to a P-complete oracle''.\n \n \n \n \n\n\n \n Chavrimootoo, M.; Le, T.; Reidy, M.; ; and Smith, E.\n\n\n \n\n\n\n Technical Report arXiv:2312.04395 [cs.CC], Computing Research Repository, arXiv.org/corr/, Dec 2023.\n
\n\n
\n\n
\n\n
\n\n \n \n link\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@techreport{cha-le-rei-smi:t:czerwinski,\r\n Author = {M. Chavrimootoo and T. Le and M. Reidy and and E. Smith},\r\n title = {On Czerwinski's ``{P} $\\neq$ {NP} relative to a {P}-complete oracle''},\r\n Month = "Dec",\r\n Year = "2023",\r\n Institution = "Computing Research Repository",\r\n Number = "arXiv:2312.04395 [cs.CC]",\r\n Address = {arXiv.org/corr/},\r\n url_link = {https://arxiv.org/abs/2312.04395}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Evaluating the Claims of ``SAT Requires Exhaustive Search''.\n \n \n \n \n\n\n \n Chavrimootoo, M.; He, Y.; Kotler-Berkowitz, M.; Liuson, H.; and Nie, Z.\n\n\n \n\n\n\n Technical Report arXiv:2312.02071 [cs.CC], Computing Research Repository, arXiv.org/corr/, Dec 2023.\n
\n\n
\n\n
\n\n
\n\n \n \n link\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@techreport{cha-he-kot-liu-nie:t:sat-exp,\r\n Author = {M. Chavrimootoo and Y. He and M. Kotler-Berkowitz and H. Liuson and Z. Nie},\r\n title = {Evaluating the Claims of ``{SAT} Requires Exhaustive Search''},\r\n Month = "Dec",\r\n Year = "2023",\r\n Institution = "Computing Research Repository",\r\n Number = "arXiv:2312.02071 [cs.CC]",\r\n Address = {arXiv.org/corr/},\r\n url_link = {https://arxiv.org/abs/2312.02071}\r\n}\r\n\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Defying Gravity and Gadget Numerosity: The Complexity of the Hanano Puzzle.\n \n \n \n \n\n\n \n Chavrimootoo, M.\n\n\n \n\n\n\n In
Proceedings of the 25th International Conference on Descriptional Complexity of Formal Systems, pages 36-50, June 2023. \n
\n\n
\n\n
\n\n
\n\n \n \n link\n \n \n \n slides\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{cha:c:hanano,\r\n\tauthor = {M. Chavrimootoo},\r\n\ttitle = {Defying Gravity and Gadget Numerosity: The Complexity of the Hanano Puzzle},\r\n\tbooktitle = {Proceedings of the 25th International Conference on Descriptional Complexity of Formal Systems},\r\n\tmonth = "June", \r\n\tpages = {36-50},\r\n\tyear = {2023},\r\n\turl_Link = {https://link.springer.com/chapter/10.1007/978-3-031-34326-1_3},\r\n\turl_Slides = {hanano_dcfs_slides.pdf},\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Separations and Collapses in Computational Social Choice.\n \n \n \n \n\n\n \n Chavrimootoo, M.\n\n\n \n\n\n\n In
Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems, pages 3026-3028, May 2023. International Foundation for Autonomous Agents and Multiagent Systems\n
\n\n
\n\n
\n\n
\n\n \n \n link\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{cha:c:dc-paper,\r\n\tauthor = {M. Chavrimootoo},\r\n\ttitle = {Separations and Collapses in Computational Social Choice},\r\n\tyear = {2023},\r\n\tbooktitle = aamas23,\r\n\tpages = {3026-3028},\r\n\tmonth = "May", \r\n \tpublisher = "International Foundation for Autonomous Agents and Multiagent Systems",\r\n\turl_Link = {https://www.southampton.ac.uk/~eg/AAMAS2023/pdfs/p3026.pdf},\r\n}\r\n\r\n\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Separating and Collapsing Electoral Control Types.\n \n \n \n \n\n\n \n \n\n\n \n\n\n\n In
Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems, pages 1743-1751, May 2023. International Foundation for Autonomous Agents and Multiagent Systems\n
\n\n
\n\n
\n\n
\n\n \n \n link\n \n \n \n video\n \n \n \n slides\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Search versus Search for Collapsing Electoral Control Types (Extended Abstract).\n \n \n \n \n\n\n \n Carleton, B.; Chavrimootoo, M.; Hemaspaandra, L.; Narváez, D.; Taliancich, C.; and Welles, H.\n\n\n \n\n\n\n In
Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems, pages 2682-2684, May 2023. International Foundation for Autonomous Agents and Multiagent Systems\n
\n\n
\n\n
\n\n
\n\n \n \n link\n \n \n \n poster\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{car-cha-hem-nar-tal-wel:c-ea:svs,\r\n\tauthor = {B. Carleton and M. Chavrimootoo and L. Hemaspaandra and \r\n\tD. Narv\\'{a}ez and C. Taliancich and H. Welles},\r\n\ttitle = {Search versus Search for Collapsing Electoral Control Types \r\n\t\t(Extended Abstract)},\r\n\tyear = {2023},\r\n\tbooktitle=aamas23,\r\n\tpages = {2682-2684},\r\n\tmonth = "May", \r\n \tpublisher = "International Foundation for Autonomous Agents and Multiagent Systems",\r\n\turl_Link = {https://www.southampton.ac.uk/~eg/AAMAS2023/pdfs/p2682.pdf},\r\n\turl_Poster = {archival/s-vs-s_poster.pdf}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n A Critique of Sopin's \"PH = PSPACE\".\n \n \n \n \n\n\n \n Chavrimootoo, M.; Clingerman, I.; and Luu, Q.\n\n\n \n\n\n\n Technical Report arXiv:2301.03487 [cs.CC], Computing Research Repository, arXiv.org/corr/, January 2023.\n
\n\n
\n\n
\n\n
\n\n \n \n link\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@techreport{cha-cli-luu:t:sopin,\r\nauthor={M. Chavrimootoo and I. Clingerman and Q. Luu},\r\n\ttitle={A Critique of {Sopin}'s "{PH} = {PSPACE}"}, \r\n\tyear={2023},\r\n\tmonth={January},\r\n\tnumber={arXiv:2301.03487 [cs.CC]},\r\n\tinstitution={Computing Research Repository, arXiv.org/corr/},\r\n\turl_Link = {https://arxiv.org/abs/2301.03487}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n\n\n\n