M. Capalbo, O. Reingold, S. Vadhan, and A. Wigderson. Randomness conductors and constant-degree expansion beyond the degree/2 barrier. In Proc. 34th ACM Symposium on the Theory of Computing, pages 659-668, 2002. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Pseudorandom Generators Hard for k-DNF Resolution and Polynomial .. - Razborov (2003) (7 citations) (Correct)
....of [ABRW00] for c = s d. We introduce this new definition mainly to stress that it is in fact the di#erence between s and c that matters, and for most applications we need not know s (and in fact even do not need regularity) Also, the ordinary lossless expanders recently constructed in [CRVW02] correspond to the case d = #s for a small constant # 0, whence our choice of the name. Despite recent progress, no explicit constructions of (r, d) lossless expanders with the parameters su#cient for our purposes are currently known. Fortunately, we will be satisfied with the following simple ....
....for it. Last, but not the least, construct explicit lossless expanders (ideally, expanders with parameters close to those in Theorem 2. 5) The importance of this last problem stretches of course well beyond proof complexity (see e.g. the impressive list of potential applications of expanders in [CRVW02] Acknowledgement I am grateful to Misha Alekhnovich, Jan Krajcek and Avi Wigderson for their interest, involvement and useful discussions at various stages of this ongoing project. ....
M. Capalbo, O. Reingold, S. Vadhan, and A. Wigderson. Randomness conductors and constant-degree expansion beyond the degree/2 barrier. In Proceedings of the 34th ACM Symposium on the Theory of Computing, pages 659--668, 2002.
LP Decoding Corrects a Constant Fraction of Errors - Feldman, Malkin, Servedio.. (2003) (Correct)
No context found.
M. Capalbo, O. Reingold, S. Vadhan, and A. Wigderson. Randomness conductors and constant-degree expansion beyond the degree/2 barrier. In Proc. 34th ACM Symposium on the Theory of Computing, pages 659-668, 2002.
The Bloomier Filter: An Efficient Data Structure for .. - Chazelle, Kilian.. (2004) (1 citation) (Correct)
No context found.
Capalbo, M., Reingold, O., Vadhan, S., Wigderson, A. Randomness conductors and constant-degree expansion beyond the degree /2 barrier, Proc. 34th STOC (2002), 659--668.
Batch Codes and Their Applications - Yuval Ishai Yuvali (2004) (Correct)
No context found.
M. Capalbo, O. Reingold, S. Vadhan, and A. Wigderson. Randomness Conductors and Constant-Degree Expansion Beyond the Degree/2 Barrier. In Proc. 34th STOC, pages 659-668, 2002.
LP Decoding Corrects a Constant Fraction of Errors - Feldman, Malkin, Servedio.. (2003) (Correct)
No context found.
M. Capalbo, O. Reingold, S. Vadhan, and A. Wigderson. Randomness conductors and constant-degree expansion beyond the degree/2 barrier. In Proc. 34th ACM Symposium on the Theory of Computing, pages 659-668, 2002.
On ε-Biased Generators in NC° - Mossel, Shpilka, Trevisan (2003) (1 citation) (Correct)
No context found.
Michael Capalbo, Omer Reingold, Salil Vadhan and Avi Wigderson. Randomness Conductors and Constant-Degree Expansion Beyond the Degree/2 Barrier. Proceedings of the 34th Symposium on the Theory of Computing, 659-668, 2000.
Pseudorandom Generators Hard for k-DNF Resolution and Polynomial .. - Razborov (2003) (7 citations) (Correct)
No context found.
M. Capalbo, O. Reingold, S. Vadhan, and A. Wigderson. Randomness conductors and constant-degree expansion beyond the degree/2 barrier. In Proceedings of the 34th ACM Symposium on the Theory of Computing, pages 659-668, 2002.
Batch Codes and Their Applications - Ishai, Kushilevitz, Ostrovsky, Sahai (2004) (Correct)
No context found.
M. Capalbo, O. Reingold, S. Vadhan, and A. Wigderson. Randomness Conductors and Constant-Degree Expansion Beyond the Degree/2 Barrier. In Proc. 34th STOC, pages 659668, 2002. 24
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