400 search results - page 18 / 80 » Derandomization and Distinguishing Complexity |
STOC
2005
ACM
16 years 6 hour ago
2005
ACM
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
ACTA
1998
14 years 11 months ago
1998
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...
CRYPTO
1989
Springer
15 years 3 months ago
1989
Springer
Abstract. In this paper, we provide a new approach to study undeniable signatures by translating secure digital signatures to secure undeniable signatures so that the existing algo...
104
click to vote
WSC
2007
15 years 2 months ago
2007
Two basic approaches to simulation model composition can be distinguished, depending on whether the unit of composition is a model specification according to a certain modeling f...
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
We consider (uniform) reductions from computing a function f to the task of distinguishing the output of some pseudorandom generator G from uniform. Impagliazzo and Wigderson [IW]...