MIT Hardness Group

According to our database, MIT Hardness Group authored at least 7 papers in 2024.

Collaborative distances:

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

2024

Complexity of 2D Snake Cube Puzzles.

MIT Hardness Group, Nithid Anchaleenukoon, Alex Dang, Erik D. Demaine, Kaylee Ji, Pitchayut Saengrungkongka

CoRR, 2024

Easier Ways to Prove Counting Hard: A Dichotomy for Generalized #SAT, Applied to Constraint Graphs.

MIT Hardness Group, Josh Brunner, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Markus Hecher, Frederick Stock, Zixiang Zhou

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Complexity of Planar Graph Orientation Consistency, Promise-Inference, and Uniqueness, with Applications to Minesweeper Variants.

MIT Hardness Group, Della H. Hendrickson, Andy Tockman

Proceedings of the 12th International Conference on Fun with Algorithms, 2024

Tetris with Few Piece Types.

MIT Hardness Group, Erik D. Demaine, Holden Hall, Jeffery Li

Proceedings of the 12th International Conference on Fun with Algorithms, 2024

ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles.

MIT Hardness Group, Josh Brunner, Lily Chung, Erik D. Demaine, Della H. Hendrickson, Andy Tockman

Proceedings of the 12th International Conference on Fun with Algorithms, 2024

You Can't Solve These Super Mario Bros. Levels: Undecidable Mario Games.

MIT Hardness Group, Hayashi Ani, Erik D. Demaine, Holden Hall, Ricardo Ruiz, Naveen Venkat

Proceedings of the 12th International Conference on Fun with Algorithms, 2024

PSPACE-Hard 2D Super Mario Games: Thirteen Doors.

MIT Hardness Group, Hayashi Ani, Erik D. Demaine, Holden Hall, Matias Korman

Proceedings of the 12th International Conference on Fun with Algorithms, 2024