3415 search results - page 435 / 683 » Lower bounds on kernelization |
157
click to vote
IPL
2006
15 years 6 months ago
2006
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
145
click to vote
JCT
2006
15 years 6 months ago
2006
In 2002, De Loera, Peterson and Su proved the following conjecture of Atanassov: let T be a triangulation of a d-dimensional polytope P with n vertices v1, v2, . . . , vn; label t...
158
click to vote
JOC
2006
15 years 6 months ago
2006
We study the role of connectivity of communication networks in private computations under information theoretic settings. It will be shown that some functions can be computed by pr...
179
click to vote
JSAC
2006
15 years 6 months ago
2006
This paper addresses the problem of routing and wavelength assignment (RWA) of scheduled lightpath demands (SLDs) in wavelength routed optical networks with no wavelength converter...
203
click to vote
EOR
2007
15 years 6 months ago
2007
This paper addresses the problem of routing and wavelength assignment (RWA) of static lightpath requests in wavelength routed optical networks. The objective is to minimize the nu...