Decomposable searching problems (Q1256856)

From MaRDI portal
Revision as of 01:32, 14 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/ipl/Bentley79, #quickstatements; #temporary_batch_1731543907597)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Decomposable searching problems
scientific article

    Statements

    title
    Decomposable searching problems (English)
    0 references
    author
    Jon Louis Bentley
    0 references
    publication date
    1979
    0 references
    zbMATH Keywords
    Decomposable Searching Problems
    0 references
    Data Structures
    0 references
    Computational Complexity
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R99
    0 references
    68Q25
    0 references
    68P05
    0 references
    zbMATH DE Number
    3628403
    0 references
    Wikidata QID
    Q56763501
    0 references
    OpenAlex ID
    W2060978628
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1256856&oldid=37911660"
    Powered by MediaWiki