• Hardness of Rubiks Tables

• Project Year: 2025
• REU Student (s):   Corbet Elkins | Purdue University-Main Campus IN  
• Project Mentor (s) : Jingjin Yu - Computer Science
• Project Abstract: Szegedy and Yu introduced the concept of Rubiks tables which provide an abstraction of object rearrangement problems. In this project, we showed several problems related to Rubiks tables are NP-hard through a reduction from minimum vertex cover.