193 search results - page 31 / 39 » A Lower Bound for the Shortest Path Problem |
133
click to vote
SIAMCOMP
2002
15 years 4 months ago
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
146
click to vote
IPL
2006
15 years 4 months ago
2006
We study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous netw...
154
click to vote
ICALP
2011
Springer
14 years 7 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
123
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
—In this paper, we study the theory of collaborative upload bandwidth measurement in peer-to-peer environments. A host can use a bandwidth estimation probe to determine the bandw...
142
click to vote
PKC
2010
Springer
15 years 6 months ago
2010
Springer
We study the problem of integer factoring given implicit information of a special kind. The problem is as follows: let N1 = p1q1 and N2 = p2q2 be two RSA moduli of same bit-size, w...