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

camu complexity-theory [17 articles]

Recent papers added to camu library classified by the tag complexity-theory. You can also see everyone's complexity-theory.
  • 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
  • The Computational Complexity of Universal Hashing
    (1990), pp. 235-243.
    by Yishay Mansour, Noam Nisan, Prasoon Tiwari
    posted to complexity-theory by camu on 2006-08-21 16:56:36 as *** along with 2 people and 3 groups rgrig scis0000001 SRG_at_UCD Crypto Randomness
  • Pseudorandom generators, measure theory, and natural proofs
    (1995)
    by K Regan, D Sivakumar, J- Cai
    posted to complexity-theory by camu on 2006-08-21 16:54:07 as ** along with 1 person and 2 groups shankar 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 vs. randomness
    J. Comput. Syst. Sci., Vol. 49, No. 2. (October 1994), pp. 149-167.
    by Noam Nisan, Avi Wigderson
    posted to complexity-theory derandomization pseudo-randomness by camu on 2006-08-21 16:46:43 as **** along with 2 groups Crypto Randomness
  • Computing Nash Equilibria: Approximation and Smoothed Complexity
    (22 Feb 2006)
    by Xi Chen, Xiaotie Deng, Shang-Hua Teng
    posted to complexity-theory game-theory by camu on 2006-08-21 16:36:01 as *** along with 2 people and 2 groups ansobol BarrosH Crypto Randomness
  • Inapproximability of Combinatorial Optimization Problems
    (24 Sep 2004)
    by Luca Trevisan
    posted to complexity-theory survey by camu on 2006-08-21 16:33:15 as *** along with 4 people and 2 groups ansobol BarrosH entropy NeilInCanadia Crypto Randomness
  • Gowers Uniformity, Influence of Variables, and PCPs
    (12 Oct 2005)
    by Alex Samorodnitsky, Luca Trevisan
    posted to complexity-theory by camu on 2006-08-21 16:32:36 as ***** along with 1 person and 2 groups BarrosH Crypto Randomness
  • Zero knowledge and the chromatic number
    Computational Complexity, 1996. Proceedings., Eleventh Annual IEEE Conference on (1996), pp. 278-287.
    by U Feige, J Kilian
    posted to complexity-theory by camu on 2006-08-21 16:32:10 as *** along with 1 person and 2 groups BarrosH Crypto Randomness
  • Computational complexity of probabilistic Turing machines
    (1974), pp. 91-95.
    by John T Gill
    posted to complexity-theory by camu on 2006-08-21 16:29:33 as *** along with 1 person and 2 groups BarrosH 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
  • On Promise Problems (a survey in memory of Shimon Even [1935-2004])
    (8 February 2005)
    by Oded Goldreich
    posted to complexity-theory by camu on 2006-08-21 16:23:01 as *** along with 1 person and 2 groups BarrosH Crypto Randomness
  • Classical physics and the Church--Turing Thesis
    J. ACM, Vol. 50, No. 1. (January 2003), pp. 100-105.
    by Andrew C Yao
    posted to complexity-theory by camu on 2006-08-21 16:07:29 as read along with 9 people and 3 groups ansobol jrw BarrosH djhda estrabd arnia dmitri83 gane5h huangxl cogent_computing Crypto Randomness
  • NP-complete Problems and Physical Reality
    (12 February 2005)
    by Scott Aaronson
    posted to complexity-theory survey by camu on 2006-08-21 16:06:57 as *** along with 13 people and 4 groups A_Olympia ansobol dsquared rdhyee geomblog rsaarelm DineshGaitonde jrw BarrosH proportional BrendaChng gane5h NeilInCanadia Philosophy_of_Information Blog_and_Wiki_Research Crypto Randomness
  • Complexity Theory for Simpletons
    (5 Jul 2005)
    by Craig A Feinstein
    posted to complexity-theory by camu on 2006-08-21 15:58:52 as ** along with 3 people and 2 groups bowerybum ansobol flybort Crypto Randomness
    • Вы можете ссылаться на эту страницу по адресу: http://www.citeulike.org/user/camu/tag/complexity-theory

    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.