1 citations · 2 across the 12 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019★ 1 cited
Faster Lattice Enumeration
Mithilesh Kumar
A lattice reduction is an algorithm that transforms the given basis of the lattice to another lattice basis such that problems like finding a shortest vector and closest vector bec…
cs.CC2019
2-CLUB is NP-hard for distance to 2-club cluster graphs
Mithilesh Kumar
We show that 2-CLUB is NP-hard for distance to 2-club cluster graphs.