27 search results - page 3 / 6 » Efficiency Bounds for Adversary Constructions in Black-Box R... |
AI
2008
Springer
13 years 7 months ago
2008
Springer
The notion of maintenance often appears in the AI literature in the context of agent behavior and planning. In this paper, we argue that earlier characterizations of the notion of...
DATE
2000
IEEE
13 years 11 months ago
2000
IEEE
The classical solving approach for two-level logic minimisation reduces the problem to a special case of unate covering and attacks the latter with a (possibly limited) branch-and...
TCC
2009
Springer
14 years 8 months ago
2009
Springer
Extractable functions are functions where any adversary that outputs a point in the range of the function is guaranteed to "know" a corresponding preimage. Here, knowledg...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
STOC
2002
ACM
14 years 7 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...