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

From MaRDI portal
Revision as of 19:52, 31 July 2024 by ReferenceBot (talk | contribs) (‎Changed an 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

    title
    Computational complexity of two pencil puzzles: Kurotto and Juosan (English)
    0 references
    author
    Chuzo Iwamoto
    0 references
    Tatsuaki Ibusuki
    0 references
    publication date
    31 March 2023
    0 references
    zbMATH Keywords
    Kurotto
    0 references
    Juosan
    0 references
    pencil puzzle
    0 references
    NP-complete
    0 references
    cites work
    Q4198056
    0 references
    Q3395518
    0 references
    Q4898148
    0 references
    Q3301014
    0 references
    Q5405470
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    68U05
    0 references
    91A80
    0 references
    zbMATH DE Number
    7670967
    0 references
    OpenAlex ID
    W3210356593
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2695483&oldid=37503821"
    Powered by MediaWiki