Reductions in PPP
暂无分享,去创建一个
[1] Paul W. Goldberg,et al. The Complexity of Computing a Nash Equilibrium , 2009, SIAM J. Comput..
[2] Xin Yang,et al. Number Balancing is as Hard as Minkowski's Theorem and Shortest Vector , 2016, IPCO.
[3] Christos H. Papadimitriou,et al. On Total Functions, Existence Theorems and Computational Complexity , 1991, Theor. Comput. Sci..
[4] Emil Jerábek. Integer factoring and modular square roots , 2016, J. Comput. Syst. Sci..
[5] Christos H. Papadimitriou,et al. On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence , 1994, J. Comput. Syst. Sci..
[6] Xiaotie Deng,et al. Settling the Complexity of Two-Player Nash Equilibrium , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[7] Miklós Ajtai,et al. Generating Hard Instances of Lattice Problems , 1996, Electron. Colloquium Comput. Complex..
[8] Manolis Zampetakis,et al. PPP-Completeness with Connections to Cryptography , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).