Revisiting the complexity of and/or graph solution (Q394337)

From MaRDI portal
Revision as of 07:23, 7 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
Revisiting the complexity of and/or graph solution
scientific article

    Statements

    title
    Revisiting the complexity of and/or graph solution (English)
    0 references
    author
    Fábio Protti
    0 references
    Maise Dantas da Silva
    0 references
    publication date
    27 January 2014
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    05C78
    0 references
    68P05
    0 references
    68Q17
    0 references
    zbMATH DE Number
    6250591
    0 references
    zbMATH Keywords
    and/or graphs
    0 references
    computational complexity
    0 references
    fixed parameter tractability
    0 references
    NP-hardness
    0 references
    W[1]-hardness
    0 references
    W[2]-hardness
    0 references
    OpenAlex ID
    W2027224637
    0 references
    arXiv ID
    1203.3249
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q394337&oldid=35370034"
    Powered by MediaWiki