Sciweavers

CORR
2010
Springer
108views Education» more  CORR 2010»
14 years 16 days ago
Inverting a permutation is as hard as unordered search
We describe a reduction from the problem of unordered search (with a unique solution) to the problem of inverting a permutation. Since there is a straightforward reduction in the ...
Ashwin Nayak