Computational Complexity Of Languages

Computational Complexity of Languages is a theoretical framework within formal language theory that classifies languages based on the asymptotic resource requirements, such as time and space, of the most efficient Turing machine deciding membership in the language.

896

Publications

45.4K

Citations

1.2K

Authors

487

Institutions

Publications per year

2017–2026

70

Authors

1.2K

  1. KS
    Kai Salomaa

    Queen's University, Canada

    17 publications · 477 citations

    14

    h-index

  2. GJ
    Galina Jirásková

    Slovak Academy of Sciences, Slovakia

    15 publications · 558 citations

    13

    h-index

  3. JB
    Janusz Brzozowski

    University of Waterloo, Canada

    11 publications · 491 citations

    11

    h-index

  4. SY
    Sheng Yü

    Western University, Canada

    10 publications · 576 citations

    10

    h-index

  5. JH
    Jack H. Lutz

    Iowa State University, United States

    10 publications · 423 citations

    10

    h-index

1–5 of 1.2K

Venues

  1. Theoretical Computer Science

    77 publications · 3.8K citations

    28

    h-index

  2. SIAM Journal on Computing

    54 publications · 5.1K citations

    28

    h-index

  3. International Journal of Foundations of Computer Science

    IJFCS · 30 publications · 1.1K citations

    18

    h-index

  4. Information and Control

    22 publications · 879 citations

    17

    h-index

  5. Journal of Computer and System Sciences

    27 publications · 1.6K citations

    17

    h-index

1–5