Hashiwokakero is NP-complete
type: Item
instance of: scholarly article
title: Hashiwokakero is NP-complete
zbMATH Open document ID: 1206.68128
author: Daniel Andersson
published in: Information Processing Letters
publication date: 2010-09-01T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 5777504
zbMATH Keywords: computational complexity
zbMATH Keywords: combinatorial problems
MaRDI profile type: Publication
Wikidata QID: Q63549437
full work available at URL: j.ipl.2009.07.017
OpenAlex ID: W2023593885
cites work: Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
cites work: Hamilton Paths in Grid Graphs
DOI: 10.1016/J.IPL.2009.07.017
description: scientific article; zbMATH DE number 5777504