Search Results for author:
Found 3 papers, 1 papers with code
Hardness of Token Swapping on Trees
We also show limitations on approximation of sequential token swapping on trees: we identify a broad class of algorithms that encompass all three known polynomial-time algorithms that achieve the best known approximation factor (which is $2$) and show that no such algorithm can achieve an approximation factor less than $2$.
Motion Planning
Data Structures and Algorithms
Computational Complexity
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible
We analyze the computational complexity of the many types of pencil-and-paper-style puzzles featured in the 2016 puzzle video game The Witness.
Computational Complexity
Solving the Rubik's Cube Optimally is NP-complete
In this paper, we prove that optimally solving an $n \times n \times n$ Rubik's Cube is NP-complete by reducing from the Hamiltonian Cycle problem in square grid graphs.
Computational Complexity Computational Geometry Combinatorics F.1.3
