Computational complexity of two pencil puzzles: Kurotto and Juosan (Q2695483)

From MaRDI portal
Revision as of 10:23, 7 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computational complexity of two pencil puzzles: Kurotto and Juosan
scientific article

    Statements

    Computational complexity of two pencil puzzles: Kurotto and Juosan (English)
    0 references
    0 references
    0 references
    31 March 2023
    0 references
    Kurotto
    0 references
    Juosan
    0 references
    pencil puzzle
    0 references
    NP-complete
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references