Information | |
---|---|
has gloss | eng: 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. |
lexicalization | eng: element distinctness problem |
instance of | c/Polynomial-time problems |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint