123 search results - page 20 / 25 » Derandomizing from Random Strings |
IEEEIAS
2009
IEEE
14 years 2 months ago
2009
IEEE
A computer worm is an autonomous malicious, selfreplicating and propagating piece of code that is able to spread fast in computer networks, exploiting the vulnerabilities it disco...
COCO
2006
Springer
13 years 11 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
ICALP
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. We consider the sequence comparison problem, also known as “hidden pattern” problem, where one searches for a given subsequence in a text (rather than a string unders...
STOC
2005
ACM
14 years 7 months ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
CC
2007
Springer
13 years 7 months ago
2007
Springer
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...