A. Lubiw and A. Racz. A lower bound for the integer element distinctiveness problem. Information and Control, 94(1):83--92, 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....3 4 log N) bounded error quantum algorithm for finding a collision in arbitrary f . Note that finding a collision in f is equivalent to deciding whether f maps all x to distinct elements. This is known as the element distinctness problem and has been well studied classically, see e.g. Yao94, LR91, Gri98] Element distinctness is particularly interesting because its classical complexity is related to that of sorting, which is well known to require N log N #(N) comparisons. If we sort f , we can decide element distinctness by going through the sorted list once, which gives a classical upper ....

A. Lubiw and A. Racz. A lower bound for the integer element distinctiveness problem. Information and Control, 94(1):83--92, 1991.

....quantum algorithm for nding a collision for arbitrary functions. Note that deciding if a collision occurs in f is equivalent to deciding whether f maps all x to distinct elements. This is known as the element distinctness problem and has been well studied classically, see e.g. Yao94, LR91, Gri98, BSSV00] Element distinctness is particularly interesting because its classical complexity is related to that of sorting, which is well known to require N log N (N) comparisons. If we sort f , we can decide element distinctness by going through the sorted list once, which gives a ....

A. Lubiw and A. Racz. A lower bound for the integer element distinctiveness problem. Information and Control, 94(1):83-92, 1991.

....quantum algorithm for finding a collision for arbitrary functions. Note that deciding if a collision occurs in f is equivalent to deciding whether f maps all x to distinct elements. This is known as the element distinctness problem and has been well studied classically, see e.g. Yao94, LR91, Gri98, BSSV00] Element distinctness is particularly interesting because its classical complexity is related to that of sorting, which is well known to require N log N Theta(N ) comparisons. If we sort f , we can decide element distinctness by going through the sorted list once, which gives a ....

A. Lubiw and A. R'acz. A lower bound for the integer element distinctiveness problem. Information and Control, 94(1):83--92, 1991.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC