element uniqueness problem造句

• This estimate is asymptotically optimal for certain models of computation, because the constructed NNG gives the answer to the element uniqueness problem : it is sufficient to check whether the NNG has a zero-length edge.
• 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.
• A common trait for many of these problems is the possibility to establish the computational complexity by reduction from the element uniqueness problem basing on an observation that if there is an efficient algorithm to compute some kind of minimal distance for a set of objects, it is trivial to check whether this distance equals to 0.