Provably Difficult Combinatorial Games (Q3854623)

From MaRDI portal
Revision as of 08:54, 22 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q1134519)
scientific article
Language Label Description Also known as
English
Provably Difficult Combinatorial Games
scientific article

    Statements

    title
    Provably Difficult Combinatorial Games (English)
    0 references
    author
    Ashok K. Chandra
    0 references
    publication date
    1979
    0 references
    zbMATH Keywords
    combinatorial game
    0 references
    completeness in exponential time
    0 references
    perfect information
    0 references
    decision problem
    0 references
    propositional formulas
    0 references
    moving markers on a graph
    0 references
    diagonalization
    0 references
    polynomial-time reducibility
    0 references

    Identifiers

    DOI
    10.1137/0208013
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    91A05
    0 references
    03D15
    0 references
    zbMATH DE Number
    3655350
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3854623&oldid=22469906"
    Powered by MediaWiki