264 search results - page 29 / 53 » On Linear Cryptanalysis with Many Linear Approximations |
130
click to vote
APPROX
2009
Springer
15 years 8 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We consider the problem of rate allocation in a Gaussian multiple-access channel, with the goal of maximizing a utility function over transmission rates. In contrast to the literat...
115
click to vote
MP
1998
15 years 1 months ago
1998
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
118
click to vote
CORR
2010
Springer
15 years 12 hour ago
2010
Springer
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
116
click to vote
FOCS
2004
IEEE
15 years 5 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...