Indexed metadata
A simple proof that the (n2 − 1)-puzzle is hard
Erik D. Demaine, Mikhail Rudoy
Source record
Source: Crossref
Published: Jul 1, 2018
DOI: 10.1016/j.tcs.2018.04.031
Open original source ↗Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.