Descriptive Complexity Of Pspace

Descriptive Complexity of PSPACE is a descriptive complexity-theoretic characterization that identifies PSPACE as the class of decision problems expressible in second-order logic with transitive closure, thereby distinguishing it through its logical definability over ordered structures.

4

Publications

55

Citations

4

Authors

7

Institutions

Publications per year

2017–2026

2

Authors

4

  1. JG
    Joaquim Gabarró

    Universitat Politècnica de Catalunya, Spain

    1 publications · 10 citations

    1

    h-index

  2. JL
    José L. Balcázar

    Universitat Politècnica de Catalunya, Spain

    1 publications · 10 citations

    1

    h-index

  3. BK
    Bernd Kirsig

    Universität Hamburg, Germany

    1 publications · 12 citations

    1

    h-index

  4. KL
    Klaus-Jörn Lange

    Universität Hamburg, Germany

    1 publications · 12 citations

    1

    h-index

1–4 of 4

Venues

  1. Information Processing Letters

    1 publications · 12 citations

    1

    h-index

  2. Journal of Membrane Computing

    1 publications · 21 citations

    1

    h-index

  3. idUS (Universidad de Sevilla)

    Repository · 1 publications · 12 citations

    1

    h-index

  4. Theoretical Computer Science

    1 publications · 10 citations

    1

    h-index

1–4