Login / Signup
The Parallel Complexity of Element Distinctness is Omega (sqrt(log n)).
Prabhakar Ragde
William L. Steiger
Endre Szemerédi
Avi Wigderson
Published in:
SIAM J. Discret. Math. (1988)
Keyphrases
</>
worst case
lower bound
upper bound
data sets
information retrieval
np hard
space complexity
parallel programming
computational complexity
artificial neural networks
special case
general purpose
load balancing
computer architecture
parallel hardware