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

Authors

63

  1. EG
    Erich Grädel

    University of Basel, Switzerland

    3 publications · 141 citations

    3

    h-index

  2. DT
    Denis Thérien

    McGill University, Canada

    2 publications · 50 citations

    2

    h-index

  3. PM
    Pierre McKenzie

    Université de Montréal, Canada

    2 publications · 50 citations

    2

    h-index

  4. NI
    Neil Immerman

    University of Massachusetts Amherst, United States

    2 publications · 652 citations

    2

    h-index

  5. MY
    Moshe Y. Vardi

    Rice University, United States

    2 publications · 85 citations

    2

    h-index

1–5 of 63

Venues

  1. Information and Computation

    4 publications · 212 citations

    4

    h-index

  2. Theoretical Computer Science

    3 publications · 218 citations

    3

    h-index

  3. Journal of Symbolic Logic

    3 publications · 106 citations

    3

    h-index

  4. Duke Law Journal

    1 publications · 41 citations

    1

    h-index

  5. 1

    h-index

1–5