Регистрация | Вход в службу | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

camu Impagliazzo [8 articles]

Recent papers posted to camu library by the author Impagliazzo. You can also see Impagliazzo everyone.
  • Limits on the provable consequences of one-way permutations
    (1989), pp. 44-61.
    by R Impagliazzo, S Rudich
    posted to seperations black-box by camu on 2007-02-09 01:20:41 as ** along with 3 people and 2 groups pcamacho TPTPTP chestylarue Crypto Randomness
  • On the complexity of succinct zero-sum games
    Computational Complexity, 2005. Proceedings. Twentieth Annual IEEE Conference on (2005), pp. 323-332.
    by L Fortnow, R Impagliazzo, V Kabanets, C Umans
    posted to complexity-theory game-theory by camu on 2006-08-21 16:59:29 as ** along with 2 groups Crypto Randomness
  • <italic>P = BPP</italic> if <italic>E</italic> requires exponential circuits: derandomizing the XOR lemma
    (1997), pp. 220-229.
    by Russell Impagliazzo, Avi Wigderson
    posted to complexity-theory derandomization pseudo-randomness by camu on 2006-08-21 16:51:11 as **** along with 1 person and 2 groups rjaiswal Crypto Randomness
  • How to recycle random bits
    Foundations of Computer Science, 1989., 30th Annual Symposium on (1989), pp. 248-253.
    by R Impagliazzo, D Zuckerman
    posted to complexity-theory derandomization pseudo-randomness by camu on 2006-08-21 16:50:22 as **** along with 1 person and 2 groups mikero Crypto Randomness
  • In search of an easy witness: exponential time vs. probabilistic polynomial time
    Journal of Computer and System Sciences, Vol. 65, No. 4. (December 2002), pp. 672-694.
    by R Impagliazzo, V Kabanets, A Wigderson
    posted to complexity-theory derandomization by camu on 2006-08-21 16:49:10 as *** along with 2 groups Crypto Randomness
  • Hardness as randomness: a survey of universal derandomization
    (28 Apr 2003)
    by Russell Impagliazzo
    posted to complexity-theory derandomization survey by camu on 2006-08-21 16:26:08 as **** along with 1 person and 2 groups BarrosH Crypto Randomness
  • A Pseudorandom Generator from any One-way Function
    SIAM J. Comput., Vol. 28, No. 4. (1999), pp. 1364-1396.
    by Johan Hastad, Russell Impagliazzo, Leonid A Levin, Michael Luby
    posted to crypto pseudo-randomness by camu on 2006-08-20 23:52:55 as *** along with 3 people and 2 groups muli alpha daviticus Crypto Randomness
  • Security preserving amplification of hardness
    Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on (1990), pp. 318-326 vol.1.
    by O Goldreich, R Impagliazzo, L Levin, R Venkatesan, D Zuckerman
    posted to crypto hardness-amplification by camu on 2006-08-20 23:42:46 as read along with 1 person and 2 groups mikero Crypto Randomness
    • Вы можете ссылаться на эту страницу по адресу: http://www.citeulike.org/user/camu/author/Impagliazzo

    RIS BibTeX
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.