The complexity of querying indefinite data about linearly ordered domains (Q676427)

From MaRDI portal
Revision as of 00:37, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of querying indefinite data about linearly ordered domains
scientific article

    Statements

    title
    The complexity of querying indefinite data about linearly ordered domains (English)
    0 references
    author
    Ron van der Meyden
    0 references
    publication date
    18 March 1997
    0 references
    zbMATH Keywords
    partial order
    0 references
    query answering
    0 references
    PTIME subproblems
    0 references

    Identifiers

    zbMATH DE Number
    992432
    0 references
    OpenAlex ID
    W2031639195
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q676427&oldid=38442804"
    Powered by MediaWiki