Structural Properties Of Complexity Classes

Structural Properties of Complexity Classes is a theoretical framework in computational complexity theory that investigates the intrinsic algebraic, logical, and combinatorial characteristics—such as completeness, closure, and hierarchy—defining the internal organization and interrelationships of complexity classes.

320

Publications

13.9K

Citations

465

Authors

278

Institutions

Publications per year

2017–2026

15

Authors

465

  1. LA
    Lane A. Hemachandra

    University of Rochester, United States

    7 publications · 541 citations

    7

    h-index

  2. KW
    Klaus W. Wagner

    University of Würzburg, Germany

    6 publications · 483 citations

    6

    h-index

  3. RV
    Ronald V. Book

    University of California, Santa Barbara, United States

    5 publications · 259 citations

    5

    h-index

  4. RA
    Richard A. Shore

    Cornell University, United States

    5 publications · 315 citations

    5

    h-index

  5. LF
    Lance Fortnow

    University of Chicago, United States

    5 publications · 204 citations

    5

    h-index

1–5 of 465

Venues

  1. Theoretical Computer Science

    29 publications · 1.1K citations

    19

    h-index

  2. SIAM Journal on Computing

    20 publications · 1.2K citations

    16

    h-index

  3. Information and Computation

    11 publications · 412 citations

    11

    h-index

  4. Journal of Symbolic Logic

    11 publications · 266 citations

    10

    h-index

  5. Theory of Computing Systems

    13 publications · 515 citations

    10

    h-index

1–5