Keyword

coNP

Description: coNP is a computational complexity class containing decision problems whose complements can be verified in polynomial time.
Wikidata ID: wiki/Q955748
OpenAlex ID: keywords/conp
1997 · Charles H. Bennett, Ethan Bernstein, et al. · SIAM Journal on Computing · 2,087
1985 · L Babai · ACM Symposium on Theory of Computing (STOC) · 921
1987 · Ravi B. Boppana, Johan Hastad, et al. · Information Processing Letters · 407
1998 · Oded Goldreich, Shafi Goldwasser · ACM Symposium on Theory of Computing (STOC) · 256
1994 · Lance Fortnow, John Rompel, et al. · Theoretical Computer Science · 213
2009 · Parikshit Gopalan, Phokion G. Kolaitis, et al. · SIAM Journal on Computing · 196
1992 · Wen-Guey Tzeng · SIAM Journal on Computing · 168
2007 · L.M. Ioannou · Quantum Information and Computation · 134
1985 · J. Hartmanis, N. Immerman, et al. · Information and Control · 132
1988 · Jim Kadin · SIAM Journal on Computing · 130
1985 · Deborah Joseph, Paul Young · Theoretical Computer Science · 119
2003 · Hirotada Kobayashi, Keiji Matsumoto, et al. · Lecture notes in computer science · 112
1989 · Jim Kadin · Journal of Computer and System Sciences · 106
2003 · Thomas Eiter, Michael Fink, et al. · Lecture notes in computer science · 103
2018 · Shuichi Hirahara · Annual Symposium on Foundations of Computer Science · 100
1988 · Lance Fortnow, Michael Sipser · Information Processing Letters · 97
1982 · Uwe Schöning · Theoretical Computer Science · 92
1982 · Charles Rackoff · Journal of the ACM · 89
2005 · Venkatesan Guruswami, Daniele Micciancio, et al. · Computational Complexity · 88
2002 · Douglas A Schwer, John E Tolsma, et al. · Combustion and Flame · 86
1994 · Richard Chang, Benny Chor, et al. · Journal of Computer and System Sciences · 86
1995 · Z.Z. Chen, S. Toda · Information and Computation · 76
2000 · Arnaud Durand, Miki Hermann, et al. · Lecture notes in computer science · 66
2013 · Carsten Lutz, İnanç Seylan, et al. · International Joint Conference on Artificial Intelligence · 65
2017 · Hirahara, Shuichi, Santhanam, Rahul · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 61
Works count: 371
Citation count: 8,495
Year
Topic
Type