A.E. Andreev, A.E.F. Clementi, and J.D.P. Rolim. Worst-case hardness suces for derandomization: A new method for hardness vs. randomness trade-o s. In Proceedings of the Twenty-Fourth International Colloquium on Automata, Languages, and Programming, pages 177-187, 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Pseudorandom generators without the XOR Lemma - Sudan, Trevisan, Vadhan (2000) (38 citations) (Correct)
.... list decoding (Thm 24) Lem 12) Thm 11 Figure 1: A comparison of our approach with previous ones. Double arrows indicate our results. 2 In fact the result of [BFNW93] was somewhat weaker, but it is easily extendible to yield this result. 3 The techniques of Andreev et al. ACR97] are a rare exception, but they yield weaker results than those of [IW97] 2 A pseudoentropy generator. Nisan and Wigderson show that when their generator is constructed using a very hard on average predicate, then the output of the generator is indistinguishable from the uniform distribution. ....
Alexander Andreev, Andrea Clementi, and Jose Rolim. Worst-case hardness suces for derandomization: a new method for hardness-randomness trade-o s. In Proceedings of ICALP'97, pages 177-187. LNC 1256S, Springer-Verlag, 1997.
On the Shannon function for partially defined Boolean functions - Miltersen (1999) (Correct)
....the Danish National Research Foundation, Department of Computer Science, University of Aarhus. Email: bromille brics.dk. Supported by the ESPRIT Long Term Research Programme of the EU under project number 20244 (ALCOM IT) 1 nal version. However in the nal version of the paper (available as [3]) the theorem itself has been restricted to the case n 1 m n O(1) and N = 2 n) According to Rolim (personal communication) their proof of the general case is very complicated and its publication has therefore been postponed inde nitely. In our opinion, the Shannon function for ....
Alexander E. Andreev, Andrea E. F. Clementi, and Jose D. P. Rolim. Worstcase hardness suces for derandomization: A new method for hardnessrandomness trade-o s. Technical Report TR96-055, Revision 01, Electronic Colloquium on Computational Complexity, 1997.
The Computational Complexity Column - Lance Fortnow Nec (Correct)
No context found.
A.E. Andreev, A.E.F. Clementi, and J.D.P. Rolim. Worst-case hardness suces for derandomization: A new method for hardness vs. randomness trade-o s. In Proceedings of the Twenty-Fourth International Colloquium on Automata, Languages, and Programming, pages 177-187, 1997.
Lecture Notes on Computational Complexity - Trevisan (2004) (Correct)
No context found.
A.E. Andreev, A.E.F. Clementi, and J.D.P. Rolim. Worst-case hardness su#ces for derandomization: A new method for hardness vs randomness trade-o#s. Theoretical Computer Science, 221:3--18, 1999.
On Pseudorandomness and Resource-Bounded Measure - Arvind Institute Of (1997) (9 citations) (Correct)
No context found.
A. Andreev, A. Clementi, and J. Rolim. Worst-case hardness suces for derandomization: a new method for hardness-randomness trade-o s. In Proc. 24th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science #1256, 177-187. Springer-Verlag, 1997.
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