"Inverting a permutation is as hard as unordered search."

Ashwin Nayak (2010)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2023-09-18

a service of  Schloss Dagstuhl - Leibniz Center for Informatics