FINDING TYPE SETS IS NP-HARD (Q4024641)

From MaRDI portal
Revision as of 09:04, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
FINDING TYPE SETS IS NP-HARD
scientific article

    Statements

    title
    FINDING TYPE SETS IS NP-HARD (English)
    0 references
    author
    David Hobby
    0 references
    publication date
    8 February 1993
    0 references
    zbMATH Keywords
    type set
    0 references
    variety generated by a finite algebra
    0 references
    \(P\)-Space-hard
    0 references
    \(P\)- Space-complete
    0 references
    composition of a set of unary functions
    0 references

    Identifiers

    zbMATH DE Number
    118359
    0 references
    OpenAlex ID
    W2056825649
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4024641&oldid=37002982"
    Powered by MediaWiki