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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/0401040 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W38294843 / rank
 
Normal rank

Latest revision as of 01:17, 20 March 2024

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