The Fewest Clues Problem (Q5282810)

From MaRDI portal
Revision as of 11:22, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6747558
Language Label Description Also known as
English
The Fewest Clues Problem
scientific article; zbMATH DE number 6747558

    Statements

    author
    Erik D. Demaine
    0 references
    Fermi Ma
    0 references
    Ariel Schvartzman
    0 references
    Erik Waingarten
    0 references
    Scott Aaronson
    0 references
    publication date
    17 July 2017
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68Q17
    0 references
    91A46
    0 references
    zbMATH DE Number
    6747558
    0 references
    zbMATH Keywords
    computational complexity
    0 references
    pencil-and-paper puzzles
    0 references
    hardness reductions
    0 references
    OpenAlex ID
    W2467681709
    0 references
    title
    The Fewest Clues Problem (English)
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5282810&oldid=37266330"
    Powered by MediaWiki