The STO-problem is NP-hard (Q1892125)

From MaRDI portal
Revision as of 19:38, 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
The STO-problem is NP-hard
scientific article

    Statements

    title
    The STO-problem is NP-hard (English)
    0 references
    author
    Krzysztof R. Apt
    0 references
    Angelo Welling
    0 references
    Peter van Emde Boas
    0 references
    publication date
    3 July 1995
    0 references
    zbMATH Keywords
    occur-check
    0 references
    Martelli-Montanari unification algorithm
    0 references

    Identifiers

    zbMATH DE Number
    762009
    0 references
    OpenAlex ID
    W2073721548
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1892125&oldid=31362431"
    Powered by MediaWiki