Bounded Second-Order Unification Is NP-Complete (Q3527311)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Bounded Second-Order Unification Is NP-Complete
scientific article

    Statements

    Bounded Second-Order Unification Is NP-Complete (English)
    0 references
    0 references
    0 references
    0 references
    25 September 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references