The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$ (Q3802607)

From MaRDI portal
Revision as of 01:17, 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
The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$
scientific article

    Statements

    The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$ (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1988
    0 references
    parallel random access machines
    0 references
    element distinctness
    0 references
    lower bound
    0 references
    PRAM
    0 references
    model of parallel computation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references