In computational complexity theory, the element distinctness problem or element uniqueness problem is the problem of determining whether all the elements of a list are distinct.
It is a well studied problem in many different models of computation. The problem may be solved by sorting the list and then checking if there are any consecutive equal elements; it may also be solved in linear expected time by a randomized algorithm that inserts each item into a hash table and compares only those elements that are placed in the same hash table cell.
It is known that the problem's time complexity is Θ(n log n), i.e., both the upper and lower bounds on its time complexity are of order of the linearithmic function in the algebraic decision tree model of computation, a model of computation in which the elements may not be used to index the computer's memory (as in the hash table solution) but may only be accessed by computing and comparing simple algebraic functions of their values. In other words, an asymptotically optimal algorithm of linearithmic time complexity is known for this model. The algebraic computation tree model basically means that the allowable algorithms are only the ones that can perform polynomial operations of bounded degree on the input data and comparisons of the results of these computations.
The same lower bound was later proved for the randomized algebraic decision tree model.
It is also known that quantum algorithms can solve this problem faster in queries. The optimal algorithm is by Andris Ambainis, and the lower bound is due to Scott Aaronson and Yaoyun Shi.
Several lower bounds in computational complexity are proved by reducing the element distinctness problem to the problem in question, i.e., by demonstrating that the solution of the element uniqueness problem may be quickly found after solving the problem in question.
Read more about Element Distinctness Problem: Restrictions, Generalization: Finding Repeated Elements
Famous quotes containing the words element and/or problem:
“To get a man soundly saved it is not enough to put on him a pair of new breeches, to give him regular work, or even to give him a University education. These things are all outside a man, and if the inside remains unchanged you have wasted your labour. You must in some way or other graft upon the man’s nature a new nature, which has in it the element of the Divine.”
—William Booth (1829–1912)
“I tell you, sir, the only safeguard of order and discipline in the modern world is a standardized worker with interchangeable parts. That would solve the entire problem of management.”
—Jean Giraudoux (1882–1944)