Keyword

complete problems

Description: Complete problems are problems within a complexity class to which every problem in that class can be reduced, representing its full computational difficulty.
Wikidata ID: wiki/Q2532728
OpenAlex ID: keywords/complete-problems
1994 · Christos H. Papadimitriou · Journal of Computer and System Sciences · 989
1985 · Stephen A. Cook · Information and Control · 739
1995 · Rod G. Downey, Michael R. Fellows · Theoretical Computer Science · 717
2006 · Rolf Niedermeier · Oxford University Press eBooks · 628
1987 · Neil Immerman · SIAM Journal on Computing · 595
2009 · Constantinos Daskalakis, Paul W. Goldberg, et al. · Communications of the ACM · 430
1976 · Neil D. Jones, William T. Laaser · Theoretical Computer Science · 312
2003 · Amit Sahai, Salil Vadhan · Journal of the ACM · 240
1975 · Janoš Šimon · eCommons (Cornell University) · 215
1987 · Stephen A Cook, Pierre McKenzie · Journal of Algorithms · 197
2006 · Oded Goldreich · Lecture notes in computer science · 174
1976 · Neil D. Jones, Y. Edmund Lien, et al. · Theory of Computing Systems · 163
1997 · Neil Deaton Jones · The MIT Press eBooks · 161
1991 · Yuri Gurevich · Journal of Computer and System Sciences · 157
1976 · E. Cardoza, R. Lipton, et al. · ACM Symposium on Theory of Computing (STOC) · 157
1992 · Piotr Berman, Georg Schnitger · Information and Computation · 140
1977 · Janos Simon · Lecture notes in computer science · 130
1986 · M W Krentel · ACM Symposium on Theory of Computing (STOC) · 121
2002 · S. Khanna, R. Motwani, et al. · Annual Symposium on Foundations of Computer Science · 112
1989 · Jim Kadin · Journal of Computer and System Sciences · 106
2003 · Jörg Flum, Martin Grohe · Information and Computation · 103
2006 · John Watrous · ACM Symposium on Theory of Computing (STOC) · 102
2010 · Itai Arad, Zeph Landau · SIAM Journal on Computing · 98
1979 · John H. Reif · ACM Symposium on Theory of Computing (STOC) · 83
1990 · Josep Díaz, Jacobo Torán · Theory of Computing Systems · 79
Works count: 266
Citation count: 8,047
Year
Topic
Type