696 search results - page 126 / 140 » A class of combinatorial identities |
ESORICS
2007
Springer
15 years 5 months ago
2007
Springer
A number of network covert channels have been proposed recently that may have important ramifications for Internet security and privacy. However, they could become ineffective in...
97
Voted
GD
2007
Springer
15 years 5 months ago
2007
Springer
A geometric simultaneous embedding of two graphs G1 = (V1, E1) and G2 = (V2, E2) with a bijective mapping of their vertex sets γ : V1 → V2 is a pair of planar straightline drawi...
110
click to vote
ICALP
2007
Springer
15 years 5 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
STACS
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
APPROX
2005
Springer
15 years 5 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...