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

From MaRDI portal
Revision as of 21:52, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





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
    25 September 2008
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references