123 search results - page 7 / 25 » Derandomizing from Random Strings |
MST
2006
14 years 11 months ago
2006
The board game FragmindTM poses the following problem: The player has to reconstruct an (unknown) string s over the alphabet . To this end, the game reports the following informati...
109
click to vote
ESA
2008
Springer
15 years 1 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
STOC
2005
ACM
15 years 5 months ago
2005
ACM
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...
101
click to vote
COLT
1992
Springer
15 years 3 months ago
1992
Springer
Language learning from positive data in the Gold model of inductive inference is investigated in a setting where the data can be modeled as a stochastic process. Specifically, the...
STOC
2007
ACM
16 years 1 days ago
2007
ACM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...