scientific article; zbMATH DE number 7229768

DOI10.4230/LIPICS.FUN.2018.24zbMATH Open1489.68109MaRDI QIDQ3301014FDOQ3301014

C. Iwamoto, Masato Haruishi, Tatsuaki Ibusuki

Publication date: 11 August 2020

Title of this publication is not available (Why is that?)

zbMATH Keywords

NP-completenesspencil puzzleHerugolfMakaro

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Game theory (91A99)

Cited In (4)

• Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle
• Physical ZKP for Makaro using a standard deck of cards
• Computational complexity of two pencil puzzles: Kurotto and Juosan
• Computational complexity of puzzles and related topics

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3301014)