Author:
Ishai Yuval,Kushilevitz Eyal,Ostrovsky Rafail,Sahai Amit
Publisher
Springer International Publishing
Reference49 articles.
1. Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case/average-case equivalence. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, El Paso, Texas, USA, 4–6 May 1997 (1997)
2. Alekhnovich, M.: More on average case vs approximation complexity. In: Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), Cambridge, MA, USA, 11–14 October 2003 (2003)
3. Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87–106 (1987)
4. Angluin, D., Kharitonov, M.: When won’t membership queries help? (Extended abstract). In: STOC (1991)
5. Applebaum, B.: Exponentially-hard gap-CSP and local PRG via local hardcore functions. In: FOCS (2017)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献