The Complexity of Some Simple Retrieval Problems (Q4061951)

From MaRDI portal
Revision as of 15:34, 19 March 2024 by Openalex240319020357 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Complexity of Some Simple Retrieval Problems
scientific article

    Statements

    title
    The Complexity of Some Simple Retrieval Problems (English)
    0 references
    DOI
    10.1145/321892.321899
    0 references
    author
    Peter Eliaš
    0 references
    Richard A. Flower
    0 references
    publication date
    1975
    0 references
    Mathematics Subject Classification ID
    68N01
    0 references
    68Q25
    0 references
    68P20
    0 references
    zbMATH DE Number
    3478383
    0 references
    OpenAlex ID
    W2006949464
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4061951&oldid=31191288"
    Powered by MediaWiki