Showing 1–13 of 13 results
/ Date/ Name
Apr 26, 2018Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossibleJun 24, 2017Tree-Residue Vertex-Breaking: a new tool for proving hardnessJun 30, 2017Hamiltonicity is Hard in Thin or Polygonal Grid Graphs, but Easy in Thin Polygonal Grid GraphsJul 11, 2017A simple proof that the $(n^2-1)$-puzzle is hardMar 9, 2018Computational Complexity of Generalized Push FightDec 21, 2015Dissection with the Fewest Pieces is Hard, Even to ApproximateJun 21, 2017Solving the Rubik's Cube Optimally is NP-completeJun 9, 2018Computational Complexity of Motion Planning of a Robot through Simple GadgetsMar 17, 2019Circumscribing Polygons and Polygonizations for Disjoint Line SegmentsJul 31, 2020New Results in Sona Drawing: Hardness and TSP SeparationJun 29, 2021Yin-Yang Puzzles are NP-completeAug 22, 2018Cookie ClickerMar 11, 2021Hardness of Token Swapping on Trees