Descriptive Complexity

Descriptive Complexity is a branch of computational complexity theory that characterizes complexity classes by the type of logical formalisms required to express the problems within them.

254

Publications

17.9K

Citations

519

Authors

308

Institutions

Publications per year

2017–2026

29

Authors

519

  1. PG
    Phokion G. Kolaitis

    University of California, Santa Cruz, United States

    4 publications · 112 citations

    4

    h-index

  2. HA
    Harald Atmanspacher

    Institute for Frontier Areas of Psychology and Mental Health, Germany

    4 publications · 331 citations

    4

    h-index

  3. MG
    Martin Grohe

    Humboldt-Universität zu Berlin, Germany

    4 publications · 225 citations

    4

    h-index

  4. BK
    Bartek Klin

    University of Warsaw, Poland

    3 publications · 60 citations

    3

    h-index

  5. LH
    Lauri Hella

    University of Helsinki, Finland

    3 publications · 86 citations

    3

    h-index

1–5 of 519

Venues

  1. Theoretical Computer Science

    9 publications · 318 citations

    9

    h-index

  2. Artificial Intelligence

    5 publications · 286 citations

    5

    h-index

  3. 5

    h-index

  4. Bulletin of Symbolic Logic

    4 publications · 140 citations

    4

    h-index

  5. Journal of Computer and System Sciences

    4 publications · 240 citations

    4

    h-index

1–5