Sciweavers

STOC
2002
ACM
107views Algorithms» more  STOC 2002»
15 years 26 days ago
Quantum lower bound for the collision problem
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
Scott Aaronson