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

From MaRDI portal
scientific article
Language Label Description Also known as
English
Revisiting the complexity of and/or graph solution
scientific article

    Statements

    Revisiting the complexity of and/or graph solution (English)
    0 references
    0 references
    0 references
    27 January 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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
    0 references
    0 references