NIST

element uniqueness

(classic problem)

Definition: The problem of determining if there are duplicates in a set of numbers.

Note: From Algorithms and Theory of Computation Handbook, page 1-26, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.

Author: CRC-A


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.

Entry modified 17 December 2004.
HTML page formatted Wed Feb 4 11:02:21 2009.

Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "element uniqueness", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 17 December 2004. (accessed TODAY) Available from: http://www.itl.nist.gov/div897/sqg/dads/HTML/elementnqnss.html

to NIST home page