841 search results - page 73 / 169 » Approximability of Minimum AND-Circuits |
148
click to vote
ECCC
2008
15 years 4 months ago
2008
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...
129
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
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...
124
click to vote
INFORMS
2008
15 years 4 months ago
2008
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...
137
click to vote
IJFCS
2006
15 years 4 months ago
2006
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...
115
click to vote
JSAC
2008
15 years 4 months ago
2008
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...