U. Vazirani and V. Vazirani, "Random Polynomial Time Equal to Semi-Random Polynomial Time", Proc. 26th FOCS, pp. 417--428, 1985. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Sample of Samplers: A Computational Perspective on Sampling - Goldreich (1997) (11 citations) (Correct)
.... string of certain length (which may be considered the outcome of its internal coin tosses) A question which has received a lot of attention in the last decade is whether randomized algorithms can be transformed into robust counterparts which may work given weak random sources (cf. e.g. [26]) Following [12] we call a random variable X a ( m) source if its support is a subset of f0; 1g and no string in its support is assigned probability mass greater than 2 Gammam . That is, m is a lower bound on the min entropy of X defined as min ff2f0;1g f Gamma log 2 (Prob(X = ....
U. Vazirani and V. Vazirani, "Random Polynomial Time Equal to Semi-Random Polynomial Time", Proc. 26th FOCS, pp. 417--428, 1985.
A Sample of Samplers: A Computational Perspective on Sampling - Goldreich (1997) (11 citations) (Correct)
.... selected string of certain length (which may be considered the outcome of its internal coin tosses) A question which has received a lot of attention in the last decade is whether algorithms can be transformed into robust counterparts which may work given also weak random sources (cf. e.g. [26]) Following [12] we call a random variable X a ( m) source if its support is a subset of f0; 1g and no string in its support is assigned probability mass greater than 2 Gammam . That is, m is a lower bound on the min entropy of X defined as min ff2f0;1g f Gamma log 2 (Prob(X = ....
U. Vazirani and V. Vazirani, "Random Polynomial Time Equal to Semi-Random Polynomial Time", Proc. 26th FOCS, pp. 417--428, 1985.
Tiny Families of Functions with Random Properties: A.. - Goldreich, Wigderson (1994) (31 citations) (Correct)
....discovered a similar construction) They completely resolve the simulation problem of BPP algorithms by Santha Vazirani [32] sources. Recall that such a source is required to give the each successive output bit a nontrivial probability ffi for both heads and tails. While the best previous result [35] required a constant ffi 0, the new result requires only that on n bit output, ffi n Gamma Omega Gamma1 . A simple information theoretic argument [11] shows that this bound is best possible. Despite the general interest in reducing the size of sample spaces achieving various random ....
U. Vazirani and V. Vazirani, "Random Polynomial Time Equal to Semi-Random Polynomial Time", Proc. 26th FOCS, pp. 417--428, 1985.
Tiny Families of Functions with Random Properties: A.. - Goldreich (1994) (31 citations) (Correct)
No context found.
U. Vazirani and V. Vazirani, "Random Polynomial Time Equal to Semi-Random Polynomial Time", Proc. 26th FOCS, pp. 417--428, 1985.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC