License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ISAAC.2019.32
URN: urn:nbn:de:0030-drops-115287
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/11528/
Go to the corresponding LIPIcs Volume Portal

Kobayashi, Yasuaki ; Suetsugu, Koki ; Tsuiki, Hideki ; Uehara, Ryuhei

On the Complexity of Lattice Puzzles

pdf-format:
LIPIcs-ISAAC-2019-32.pdf (1 MB)

Abstract

In this paper, we investigate the computational complexity of lattice puzzle, which is one of the traditional puzzles. A lattice puzzle consists of 2n plates with some slits, and the goal of this puzzle is to assemble them to form a lattice of size n x n. It has a long history in the puzzle society; however, there is no known research from the viewpoint of theoretical computer science. This puzzle has some natural variants, and they characterize representative computational complexity classes in the class NP. Especially, one of the natural variants gives a characterization of the graph isomorphism problem. That is, the variant is GI-complete in general. As far as the authors know, this is the first non-trivial GI-complete problem characterized by a classic puzzle. Like the sliding block puzzles, this simple puzzle can be used to characterize several representative computational complexity classes. That is, it gives us new insight of these computational complexity classes.

BibTeX - Entry

@InProceedings{kobayashi_et_al:LIPIcs:2019:11528,
  author =	{Yasuaki Kobayashi and Koki Suetsugu and Hideki Tsuiki and Ryuhei Uehara},
  title =	{{On the Complexity of Lattice Puzzles}},
  booktitle =	{30th International Symposium on Algorithms and Computation (ISAAC 2019)},
  pages =	{32:1--32:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-130-6},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{149},
  editor =	{Pinyan Lu and Guochuan Zhang},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2019/11528},
  URN =		{urn:nbn:de:0030-drops-115287},
  doi =		{10.4230/LIPIcs.ISAAC.2019.32},
  annote =	{Keywords: Lattice puzzle, NP-completeness, GI-completeness, FPT algorithm}
}

Keywords: Lattice puzzle, NP-completeness, GI-completeness, FPT algorithm
Collection: 30th International Symposium on Algorithms and Computation (ISAAC 2019)
Issue Date: 2019
Date of publication: 28.11.2019

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI