I&C Journal 1991 Journal Article
A lower bound for the integer element distinctness problem
- Anna Lubiw
- András Rácz
A lower bound of Ω(n log n) is proved for the integer element distinctness problem—Given (x 1, …, x n ) ϵ Z n, are the x i 's distinct—on the bounded-order algebraic decision tree model.