331 search results - page 7 / 67 » New Results on the Pseudorandomness of Some Blockcipher Cons... |
APPROX
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We give a generic construction of an optimal hitting set generator (HSG) from any good “reconstructive” disperser. Past constructions of optimal HSGs have been based ...
STOC
2005
ACM
14 years 9 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...
FIMI
2004
13 years 10 months ago
2004
Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related tec...
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
EUROGP
2006
Springer
14 years 22 days ago
2006
Springer
This paper introduces a new representation for assemblies of small Lego -like elements: structures are indirectly encoded as construction plans. This representation shows some inte...