612 search results - page 40 / 123 » Hardness assumptions in the foundations of theoretical compu... |
WG
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In many security protocols, such as group protocols, principals have to perform iterative or recursive computations. We call such protocols recursive protocols. Recently,...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
Secret sharing and multiparty computation (also called “secure function evaluation”) are fundamental primitives in modern cryptography, allowing a group of mutually distrustfu...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Given two 3-connected graphs G and H, a construction sequence constructs
G from H (e. g. from the K4) with three basic operations, called
the Barnette-Grünbaum operations. These...
STACS
2001
Springer
14 years 5 days ago
2001
Springer
We study effectively given positive reals (more specifically, computably enumerable reals) under a measure of relative randomness introduced by Solovay [32] and studied by Calud...