Sciweavers

123 search results - page 2 / 25
» Derandomizing from Random Strings
Sort
View
APPROX
2004
Springer
121views Algorithms» more  APPROX 2004»
13 years 11 months ago
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
Andris Ambainis, Adam Smith
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 6 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
CORR
2011
Springer
147views Education» more  CORR 2011»
13 years 1 months ago
Symmetry of information and bounds on nonuniform randomness extraction via Kolmogorov extractors
We prove a strong Symmetry of Information relation for random strings (in the sense of Kolmogorov complexity) and establish tight bounds on the amount on nonuniformity that is nec...
Marius Zimand
SODA
2004
ACM
111views Algorithms» more  SODA 2004»
13 years 7 months ago
Reconstructing strings from random traces
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...
Tugkan Batu, Sampath Kannan, Sanjeev Khanna, Andre...
CORR
2010
Springer
150views Education» more  CORR 2010»
13 years 3 months ago
On extracting common random bits from correlated sources
Suppose Alice and Bob receive strings of unbiased independent but noisy bits from some random source. They wish to use their respective strings to extract a common sequence of ran...
Andrej Bogdanov, Elchanan Mossel