612 search results - page 17 / 123 » Hardness assumptions in the foundations of theoretical compu... |
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...
SIGECOM
2006
ACM
14 years 1 months ago
2006
ACM
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
GI
2005
Springer
14 years 1 months ago
2005
Springer
: Intrusion tolerance is a recent approach to deal with intentional and malicious failures. It combines the research on fault tolerance with the research on security, and relies on...
FOCS
2003
IEEE
14 years 1 months ago
2003
IEEE
We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...