239 search results - page 15 / 48 » Hardness and algorithms for rainbow connection |
ECCC
2008
14 years 9 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...
DIALM
2004
ACM
15 years 1 months ago
2004
ACM
The wireless connectivity, essential for pervasive computing, has ephemeral character and can be used for creating ad hoc networks, sensor networks, connection with RFID tags etc....
IWCMC
2010
ACM
15 years 2 months ago
2010
ACM
In reactive routing protocols, active routes for multihop connections retain their topological structure in spite of node movement over time. Unfortunately, node movements may mak...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
SIAMCOMP
1998
14 years 9 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...