Capture Of Complexity Classes
Capture of Complexity Classes is a formal framework in descriptive complexity theory that characterizes computational complexity classes by means of logical definability, distinguishing itself through the precise correspondence between logical languages and the resource-bounded computations of Turing machines.
38
Publications
3.8K
Citations
63
Authors
59
Institutions
Publications per year
2017–2026
0
Parents
38
Determining computational complexity from characteristic ‘phase transitions’
Rémi Monasson, Riccardo Zecchina, Scott Kirkpatrick et al. · Nature · 1999 · 803 citations
Languages that Capture Complexity Classes
Neil Immerman · SIAM Journal on Computing · 1987 · 545 citations
Mathematical foundation of a new complexity measure
Gu Fanji · Applied Mathematics and Mechanics · 2005 · 117 citations
1–5 of 38
63
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 63
59
University of Michigan
Ann Arbor, United States
3 h-index
3 publications
684 citations
IBM (United States)
Armonk, United States
2 h-index
2 publications
835 citations
RWTH Aachen University
Aachen, Germany
2 h-index
2 publications
40 citations

University of Basel
Basel, Switzerland
2 h-index
2 publications
121 citations
Hebrew University of Jerusalem
Jerusalem, Israel
2 h-index
2 publications
869 citations

McGill University
Montreal, Canada
2 h-index
2 publications
50 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
2 h-index
2 publications
85 citations
Université de Montréal
Montreal, Canada
2 h-index
2 publications
50 citations
1–8 of 59
4 publications · 212 citations
4
h-index
3 publications · 218 citations
3
h-index
3 publications · 106 citations
3
h-index
1 publications · 41 citations
1
h-index
Conference · 1 publications · 10 citations
1
h-index
1–5