Space complexity vs. query complexity (Q937195)

From MaRDI portal
Revision as of 01:35, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Space complexity vs. query complexity
scientific article

    Statements

    title
    Space complexity vs. query complexity (English)
    0 references
    author
    Oded Lachish
    0 references
    Ilan Newman
    0 references
    Asaf Shapira
    0 references
    publication date
    20 August 2008
    0 references
    Mathematics Subject Classification ID
    68Q15
    0 references
    68Q10
    0 references
    68Q45
    0 references
    zbMATH DE Number
    5314387
    0 references
    zbMATH Keywords
    bounded space
    0 references
    complexity
    0 references
    lower bounds
    0 references
    property testing
    0 references
    OpenAlex ID
    W2026717573
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q937195&oldid=32618592"
    Powered by MediaWiki