Logical Characterizations of Complexity Classes is a theoretical framework in descriptive complexity theory that identifies complexity classes with precisely those sets of problems definable in specific logics, thereby distinguishing itself by establishing equivalences between computational resource bounds and logical expressibility.
99
Publications
4.3K
Citations
147
Authors
125
Institutions
Publications per year
2017–2026
6
Parents
Publications
99
Soft linear logic and polynomial time
Yves Lafont · Theoretical Computer Science · 2003 · 187 citations
1–5 of 99
Authors
147
- AD
4
h-index
- IA
3
h-index
- PH
3
h-index
- GG
3
h-index
- DF
2
h-index
1–5 of 147
Institutions
125
Centre National de la Recherche Scientifique
Paris, France
7 h-index
9 publications
360 citations
University of Helsinki
Helsinki, Finland
5 h-index
6 publications
171 citations
Université Paris Cité
Paris, France
4 h-index
4 publications
89 citations
University of California San Diego
San Diego, United States
3 h-index
3 publications
107 citations
Czech Academy of Sciences
Prague, Czechia
3 h-index
3 publications
71 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
3 h-index
3 publications
120 citations
Humboldt-Universität zu Berlin
Berlin, Germany
3 h-index
3 publications
88 citations
Czech Academy of Sciences, Institute of Computer Science
Prague, Czechia
3 h-index
3 publications
71 citations
1–8 of 125
Venues
- Theoretical Computer Science
7 publications · 561 citations
7
h-index
- Logical Methods in Computer Science
LMCS · 6 publications · 118 citations
6
h-index
- Information and Computation
5 publications · 317 citations
5
h-index
- Journal of Computer and System Sciences
4 publications · 416 citations
4
h-index
- Annals of Pure and Applied Logic
3 publications · 60 citations
3
h-index
1–5