The complexity of game isomorphism (Q650900)

From MaRDI portal
Revision as of 18:04, 4 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
The complexity of game isomorphism
scientific article

    Statements

    title
    The complexity of game isomorphism (English)
    0 references
    author
    Joaquim Gabarró
    0 references
    Alina García
    0 references
    Maria J. Serna
    0 references
    publication date
    7 December 2011
    0 references
    Mathematics Subject Classification ID
    91A70
    0 references
    91A99
    0 references
    68Q25
    0 references
    zbMATH DE Number
    5986996
    0 references
    zbMATH Keywords
    game isomorphism
    0 references
    succinct representations
    0 references
    formula games
    0 references
    Boolean formulas
    0 references
    computational complexity
    0 references
    circuit isomorphism
    0 references
    Boolean formula isomorphism
    0 references
    graph isomorphism
    0 references
    OpenAlex ID
    W2052601701
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q650900&oldid=35257544"
    Powered by MediaWiki