Structural Complexity

Structural Complexity is a subfield of computational complexity theory that investigates the inherent relationships among complexity classes, reducibilities, and completeness to understand the internal structure of computational problems.

3.4K

Publications

208.9K

Citations

5.1K

Authors

1.7K

Institutions

Publications per year

2017–2026

383

Authors

5.1K

  1. AL
    Alan L. Selman

    University at Buffalo, State University of New York, United States

    18 publications · 1.3K citations

    16

    h-index

  2. MG
    Martin Grohe

    Humboldt-Universität zu Berlin, Germany

    18 publications · 972 citations

    14

    h-index

  3. GG
    Georg Gottlob

    TU Wien, Austria

    16 publications · 1.6K citations

    13

    h-index

  4. PH
    Pavol Hell

    Simon Fraser University, Canada

    13 publications · 1.2K citations

    13

    h-index

  5. VH
    Valentina Harizanov

    George Washington University, United States

    12 publications · 386 citations

    12

    h-index

1–5 of 5.1K

Venues

  1. Theoretical Computer Science

    163 publications · 7.6K citations

    44

    h-index

  2. SIAM Journal on Computing

    84 publications · 8K citations

    41

    h-index

  3. Journal of Computer and System Sciences

    58 publications · 6.8K citations

    32

    h-index

  4. Discrete Applied Mathematics

    51 publications · 2.4K citations

    29

    h-index

  5. Journal of Symbolic Logic

    72 publications · 2.3K citations

    29

    h-index

1–5