8 search results - page 2 / 2 » eccc 1998 |
122
click to vote
ECCC
1998
14 years 12 months ago
1998
In this paper, we give two explicit constructions of extractors, both of which work for a source of any min-entropy on strings of length n. The rst extracts any constant fraction ...
ECCC
1998
14 years 12 months ago
1998
Impagliazzo and Wigderson IW97] have recently shown that if there exists a decision problem solvable in time 2O(n) and having circuit complexity 2 (n) (for all but nitely many n) ...
ECCC
1998
14 years 12 months ago
1998
The Chinese Remainder Theorem states that a positive integer m is uniquely speci ed by its remainder modulo k relatively prime integers p1;:::;pk, provided m < Qk i=1 pi. Thus ...