13987 search results - page 240 / 2798 » The Two Guards Problem |
122
click to vote
CRYPTO
2009
Springer
15 years 10 months ago
2009
Springer
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...
126
click to vote
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
117
Voted
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
We review recent work on the Hierarchical-If-And-Only-If problem and present a new hierarchical problem, HIFF-M that does not fit with previous explanations for evolutionary diffi...
122
Voted
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
In the well-studied Majority problem, we are given a set of n balls colored with two or more colors, and the goal is to use the minimum number of color comparisons to find a ball ...
129
Voted
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...