On the complexity of data disjunctions. (Q1853503)

From MaRDI portal
Revision as of 11:26, 5 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the complexity of data disjunctions.
scientific article

    Statements

    title
    On the complexity of data disjunctions. (English)
    0 references
    author
    Thomas Eiter
    0 references
    Helmut Veith
    0 references
    publication date
    21 January 2003
    0 references
    Mathematics Subject Classification ID
    68P15
    0 references
    68N17
    0 references
    68Q25
    0 references
    zbMATH DE Number
    1857042
    0 references
    zbMATH Keywords
    Data disjunction
    0 references
    Deductive databases
    0 references
    Computational complexity
    0 references
    Complexity upgrading
    0 references
    Conversion lemma
    0 references
    cites work
    Q4864249
    0 references
    Q4251059
    0 references
    Q4225120
    0 references
    Q3789107
    0 references
    Q3339245
    0 references
    Q4391449
    0 references
    Q4694758
    0 references
    Q3939270
    0 references
    Q5285980
    0 references
    Q5285981
    0 references
    Q4258578
    0 references
    Bounded Query Classes
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1853503&oldid=34330727"
    Powered by MediaWiki