Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > INVERTING A PERMUTATION:
Reports tagged with Inverting a permutation:
TR10-121 | 28th July 2010
Ashwin Nayak

Inverting a permutation is as hard as unordered search

Revisions: 1

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 reverse direction, the problems are essentially equivalent.

The reduction helps us bypass the Bennett-Bernstein-Brassard-Vazirani hybrid argument (1997} and the Ambainis quantum adversary ... more >>>




ISSN 1433-8092 | Imprint