Author:
Goldberg Paul W.,Papadimitriou Christos H.
Publisher
Springer International Publishing
Reference25 articles.
1. Agrawal, M., Kayal, N., Saxena, N.: PRIMES is in P. Ann. Math. 160(2), 781–793 (2004)
2. Ban, F., Jain, K., Papadimitriou, C.H., Psomas, C.A., Rubinstein, A.: Reductions in PPP. Manuscript (2016)
3. Beame, P., Cook, S., Edmonds, J., Impagliazzo, R., Pitassi, T.: The relative complexity of NP search problems. In: 27th ACM Symposium on Theory of Computing, pp. 303–314 (1995)
4. Beckmann, A., Buss, S.: The NP Search Problems of Frege and Extended Frege Proofs, preliminary draft, December 2015
5. Bitansky, N., Paneth, O., Rosen, A.: On the cryptographic hardness of finding a Nash equilibrium. In: FOCS 2015, pp. 1480–1498 (2015)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. What is in #P and what is not?;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
2. The complexity of the parity argument with potential;Journal of Computer and System Sciences;2021-09
3. The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg;Bulletin of the American Mathematical Society;2019-01-25