We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...
A pants decomposition of an orientable surface is a collection of simple cycles that partition into pants, i.e., surfaces of genus zero with three boundary cycles. Given a set P...
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
Sebastian Wernicke, Jochen Alber, Jens Gramm, Jion...
Abstract--In this paper, a vector-form factor graph representation is derived for intersymbol interference (ISI) channels. The resultant graphs have a tree-structure that avoids th...