Author:
Chakraborty Suvradip,Prabhakaran Manoj,Wichs Daniel
Publisher
Springer Nature Switzerland
Reference17 articles.
1. Beigel, R.: On the relativized power of additional accepting paths. In: Proceedings: Fourth Annual Structure in Complexity Theory Conference, University of Oregon, Eugene, Oregon, USA, 19–22 June 1989, pp. 216–224. IEEE Computer Society (1989)
2. Beigel, R., Buhrman, H., Fortnow, L.: NP might not be as easy as detecting unique solutions. In: Scott Vitter, J. (ed.) Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, Dallas, Texas, USA, 23–26 May 1998, pp. 203–208. ACM (1998)
3. LNCS;E Boyle,2011
4. Part I, volume 12110 of LNCS;S Chakraborty,2020
5. Dodis, Y., Haralambiev, K., López-Alt, A., Wichs, D.: Cryptography against continuous memory attacks. In: 51st FOCS, pp. 511–520. IEEE Computer Society Press (2010)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Polynomial-Time Pseudodeterministic Construction of Primes;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
2. Non-interactive Zero-Knowledge from Non-interactive Batch Arguments;Advances in Cryptology – CRYPTO 2023;2023