Keyword

proof complexity

Description: A field in mathematical logic and theoretical computer science that studies the size and difficulty of formal proofs in different proof systems.
Wikidata ID: wiki/Q7249999
OpenAlex ID: keywords/proof-complexity
2009 · Sanjeev Arora, Boaz Barak · Cambridge University Press eBooks · 4,153
1985 · S Goldwasser, S Micali, et al. · ACM Symposium on Theory of Computing (STOC) · 1,781
1983 · G. S. Tseitin · Springer eBooks · 1,514
2004 · Victor Shoup · IACR Cryptology ePrint Archive · 1,080
1970 · G. S. Tseitin · Springer eBooks · 654
1987 · Alasdair Urquhart · Journal of the ACM · 531
1997 · Pavel Pudlák · Journal of Symbolic Logic · 515
1988 · Vašek Chvátal, Endre Szemerédi · Journal of the ACM · 494
1996 · Matthew Clegg, Jeffery Edmonds, et al. · ACM Symposium on Theory of Computing (STOC) · 388
1998 · Jean-Yves Girard · Information and Computation · 386
1998 · Michael J. Fischer, Michael O. Rabin · Texts & monographs in symbolic computation/Texts and monographs in symbolic computation · 348
1975 · Vaughan R. Pratt · SIAM Journal on Computing · 345
1987 · W. Cook, C.R. Coullard, et al. · Discrete Applied Mathematics · 341
1983 · R. Kowalski, D. Kuehner · Springer eBooks · 313
1974 · Gregory J. Chaitin · Journal of the ACM · 280
1975 · Stephen A. Cook · ACM Symposium on Theory of Computing (STOC) · 238
1994 · Alexander Polishchuk, Daniel A. Spielman · ACM Symposium on Theory of Computing (STOC) · 236
2002 · P. Beame, T. Pitassi · Annual Symposium on Foundations of Computer Science · 233
1993 · Toniann Pitassi, Paul Beame, et al. · Computational Complexity · 231
1989 · Jan Krajíček, Pavel Pudlák · Journal of Symbolic Logic · 230
2020 · Anup Rao, Amir Yehudayoff · Cambridge University Press eBooks · 226
1987 · Samuel R. Buss · Journal of Symbolic Logic · 219
2000 · Michael Alekhnovich, Eli Ben-Sasson, et al. · ACM Symposium on Theory of Computing (STOC) · 214
1995 · Jan Krajíček, Pavel Pudlák, et al. · Random Structures and Algorithms · 214
2000 · Erik D. Demaine, Alejandro López-Ortíz, et al. · Symposium on Discrete Algorithms · 211
Works count: 2,144
Citation count: 40,510
Year
Topic
Type