Fault tolerant graphs, perfect hash functions and disjoint pathsThe shortest vector problem in L 2 is NP-hard for randomized reductions
