1 citations · 2 across the 12 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DS2020
Obtuse Lattice Bases
Kanav Gupta, Mithilesh Kumar, Håvard Raddum
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.DS2020
Deletion to Induced Matching
Akash Kumar, Mithilesh Kumar
In the DELETION TO INDUCED MATCHING problem, we are given a graph on vertices, edges and a non-negative integer and asks whether there exists a set of vertices $S \…