2 papers
cs.DS2021
Efficient reductions and algorithms for variants of Subset Sum
Pranjal Dutta, Mahesh Sreekumar Rajasree
Given , the Subset Sum problem () is to decide whether there exists such that $\sum_{i \in S}…
cs.CC2018
On the Maximum Distance Sublattice Problem and Closest Vector Problem
Rajendra Kumar, Shashank K Mehta, Mahesh Sreekumar Rajasree
In this paper, we introduce the Maximum Distance Sublattice Problem (MDSP). We observed that the problem of solving an instance of the Closest Vector Problem (CVP) in a lattice $\m…