On the complexity of Boolean unification (Q293360)

From MaRDI portal
Revision as of 10:08, 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
On the complexity of Boolean unification
scientific article

    Statements

    title
    On the complexity of Boolean unification (English)
    0 references
    author
    Franz Baader
    0 references
    publication date
    9 June 2016
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68Q17
    0 references
    68T15
    0 references
    zbMATH DE Number
    6590751
    0 references
    zbMATH Keywords
    computational complexity
    0 references
    automatic theorem proving
    0 references
    Wikidata QID
    Q57383729
    0 references
    OpenAlex ID
    W1981232804
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q293360&oldid=37015423"
    Powered by MediaWiki