Descriptive Complexity Of P

Descriptive Complexity of P is a formal framework in computational complexity theory that characterizes the class P by identifying it with the set of problems expressible in first-order logic augmented with a least fixed-point operator, thereby distinguishing it from other descriptive complexity classes by its specific logical definability of polynomial-time computable properties.

7

Publications

215

Citations

18

Authors

11

Institutions

Publications per year

2017–2026

2

Authors

18

  1. SS
    Sanjeev Saluja

    Tata Institute of Fundamental Research, India

    1 publications · 51 citations

    1

    h-index

  2. EB
    E. Bir

    Brazilian Academy of Sciences, Brazil

    1 publications · 16 citations

    1

    h-index

  3. KV
    K. V. Subrahmanyam

    Chennai Mathematical Institute, India

    1 publications · 51 citations

    1

    h-index

  4. BK
    Bartek Klin

    University of Warsaw, Poland

    1 publications · 30 citations

    1

    h-index

  5. QJ
    Qing‐Shan Jia

    Tsinghua University, China

    1 publications · 12 citations

    1

    h-index

1–5 of 18

Venues

  1. Applied Mathematics and Computation

    1 publications · 16 citations

    1

    h-index

  2. 1

    h-index

  3. arXiv (Cornell University)

    Repository · 1 publications · 48 citations

    1

    h-index

  4. 1

    h-index

  5. Journal of Symbolic Logic

    1 publications · 45 citations

    1

    h-index

1–5