On the parameterized complexity of associative and commutative unification (Q729894)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the parameterized complexity of associative and commutative unification
scientific article

    Statements

    On the parameterized complexity of associative and commutative unification (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 December 2016
    0 references
    0 references
    unification
    0 references
    parameterized algorithm
    0 references
    dynamic programming
    0 references
    tree edit distance
    0 references
    0 references
    0 references
    0 references