
DimensionPreserving Reductions Between SVP and CVP in Different pNorms
We show a number of reductions between the Shortest Vector Problem and t...
read it

Hardness of Approximation of (Multi)LCS over Small Alphabet
The problem of finding longest common subsequence (LCS) is one of the fu...
read it

Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding
The most important computational problem on lattices is the Shortest Vec...
read it

Maximum Distance SubLattice Problem
In this paper, we define a problem on lattices called the Maximum Distan...
read it
Rajendra Kumar
is this you? claim profile