Descriptive Complexity Of Np

Descriptive Complexity of NP is a branch of computational complexity theory that characterizes the complexity class NP through the lens of logical definability by identifying it with the set of problems expressible in existential second-order logic.

8

Publications

170

Citations

15

Authors

11

Institutions

Publications per year

2017–2026

2

Authors

15

  1. KW
    Kenneth W. Regan

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

    1 publications · 28 citations

    1

    h-index

  2. QZ
    Qianchuan Zhao

    Tsinghua University, China

    1 publications · 12 citations

    1

    h-index

  3. BK
    Bartek Klin

    University of Warsaw, Poland

    1 publications · 30 citations

    1

    h-index

  4. TS
    Thomas Schwentick

    TU Dortmund University, Germany

    1 publications · 29 citations

    1

    h-index

  5. PG
    Phokion G. Kolaitis

    University of California, Santa Cruz, United States

    1 publications · 29 citations

    1

    h-index

1–5 of 15

Venues

  1. Journal of the ACM

    JACM · 1 publications · 29 citations

    1

    h-index

  2. Journal of Psycholinguistic Research

    1 publications · 28 citations

    1

    h-index

  3. World Englishes

    WE · 1 publications · 19 citations

    1

    h-index

  4. 1

    h-index

1–4