Matchstick puzzles on a grid

DOI10.1007/s00373-019-02078-3zbMath1432.68184OpenAlexW2970731329MaRDI QIDQ2308506

Shohei Mishiba, Yasuhiko Takenaga, Haruka Sugiyama

Publication date: 3 April 2020

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-019-02078-3

zbMATH Keywords

algorithmpuzzleNP-completenessstring matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Hashiwokakero is NP-complete
• On string matching with mismatches
• Faster algorithms for string matching with k mismatches
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Matchstick puzzles on a grid