Keyword

PPAD-completeness

Description: PPAD-completeness is a computational complexity classification for problems that are as hard as every problem in PPAD, a class associated with finding equilibria.
OpenAlex ID: keywords/ppad-completeness
2009 · Constantinos Daskalakis, Paul W. Goldberg, et al. · SIAM Journal on Computing · 1,268
2009 · Xi Chen, Xiaotie Deng, et al. · Journal of the ACM · 831
2006 · Xi Chen, Xiaotie Deng · Annual Symposium on Foundations of Computer Science · 614
2006 · Constantinos Daskalakis, Paul W. Goldberg, et al. · ACM Symposium on Theory of Computing (STOC) · 584
2010 · Kousha Etessami, Mihalis Yannakakis · SIAM Journal on Computing · 360
2005 · Xi Chen, Xiaotie Deng · Electronic colloquium on computational complexity · 203
2021 · Constantinos Daskalakis, Stratis Skoulakis, et al. · ACM Symposium on Theory of Computing (STOC) · 185
2005 · Constantinos Daskalakis, Christos H. Papadimitriou · Electronic colloquium on computational complexity · 171
2009 · Xi Chen, Decheng Dai, et al. · Annual Symposium on Foundations of Computer Science · 164
2011 · Elad Hazan, Robert Krauthgamer · SIAM Journal on Computing · 143
2005 · Xi Chen, Xiaotie Deng · Electronic colloquium on computational complexity · 130
2013 · Constantinos Daskalakis · ACM Transactions on Algorithms · 127
2011 · Yang Cai, Constantinos Daskalakis · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 127
2015 · Aviad Rubinstein · ACM Symposium on Theory of Computing (STOC) · 107
2012 · Xiaotie Deng, Qi Qi, et al. · Operations Research · 106
2006 · Xi Chen, Xiaotie Deng · Theoretical Computer Science · 101
2009 · Constantinos Daskalakis, Christos H. Papadimitriou · ACM Symposium on Theory of Computing (STOC) · 98
2018 · Aviad Rubinstein · SIAM Journal on Computing · 93
2006 · Bruno Codenotti, Amin Saberi, et al. · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 84
2006 · Edith Elkind, Leslie Ann Goldberg, et al. · ACM Conference on Electronic Commerce (EC) · 81
2015 · Jugal Garg, Ruta Mehta, et al. · SIAM Journal on Computing · 75
2006 · Constantinos Daskalakis, Alex Fabrikant, et al. · Lecture notes in computer science · 67
2022 · Xiaotie Deng, Ningyuan Li, et al. · National Science Review · 66
2017 · Xi Chen, Dimitris Paparas, et al. · Journal of the ACM · 64
2017 · Jugal Garg, Ruta Mehta, et al. · ACM Symposium on Theory of Computing (STOC) · 61
Works count: 227
Citation count: 7,474
Year
Topic
Type