Keyword

descriptive complexity

Description: Descriptive complexity is a branch of mathematical logic that studies computational complexity through the expressive power of formal languages.
Wikidata ID: wiki/Q1200755
OpenAlex ID: keywords/descriptive-complexity
2004 · Leonid Libkin · Springer eBooks · 1,336
1998 · Blum, Lenore · Choice Reviews Online · 1,224
1999 · Neil Immerman · Springer eBooks · 957
1992 · Jin-Yi Cai, Martin F�rer, et al. · COMBINATORICA · 835
2012 · Jaroslav Nešetřil, Patrice Ossona de Mendez · Algorithms and combinatorics · 780
1983 · M. Ajtai · Annals of Pure and Applied Logic · 755
1980 · Dana Angluin · Journal of Computer and System Sciences · 674
1987 · Neil Immerman · SIAM Journal on Computing · 595
1996 · Howard Becker, Alexander S. Kechris · Cambridge University Press eBooks · 519
1975 · Michael Mortimer · Mathematical logic quarterly · 365
1986 · Klaus W. Wagner · Acta Informatica · 352
1990 · Neil Immerman, Eric Lander · Springer eBooks · 344
1982 · Neil Immerman · Journal of Computer and System Sciences · 289
1984 · Yuri Gurevich · Lecture notes in mathematics · 281
2017 · Martin Grohe · Cambridge University Press eBooks · 247
1981 · Neil Immerman · Journal of Computer and System Sciences · 221
1996 · Detlef Seese · Mathematical Structures in Computer Science · 207
2021 · Martin Grohe · ACM/IEEE Symposium on Logic in Computer Science (LICS) · 167
2001 · Jörg Flum, Martin Grohe · SIAM Journal on Computing · 157
1989 · M. P. Consens, A. O. Mendelzon · ACM Conference on Hypertext and Social Media (HT) · 149
2004 · Ellul, Keith, Krawetz, Bryan, et al. · Journal of automata, languages and combinatorics · 146
2010 · Erich Grädel, Phokion G. Kolaitis, et al. · UvA-DARE (University of Amsterdam) · 144
1990 · Miklos Ajtai, Ronald Fagin · Journal of Symbolic Logic · 138
2014 · Rachel M. Gisselquist · Policy Studies · 136
Works count: 1,248
Citation count: 18,940
Year
Topic
Type