Author:
Applebaum Benny,Ishai Yuval,Kushilevitz Eyal
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Alekhnovich, M.: More on average case vs approximation complexity. In: Proc. 44th FOCS, pp. 298–307 (2003)
2. Alon, N., Roichman, Y.: Random cayley graphs and expanders. Random Struct. Algorithms 5(2), 271–285 (1994)
3. Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in NC0. SIAM J. Comput. (to appear);
4. Preliminary version in FOCS??2004
5. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and hardness of approximation problems. J. of the ACM 45(3), 501–555 (1998)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献