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
Parents
4
1–4 of 4
4
1
h-index
1
h-index
1
h-index
1
h-index
1–4 of 4
7

Centre National de la Recherche Scientifique
Paris, France
1 h-index
1 publications
21 citations

Université de Toulon
La Garde, France
1 h-index
1 publications
21 citations
Universität Hamburg
Hamburg, Germany
1 h-index
2 publications
24 citations
Aix-Marseille Université
Marseille, France
1 h-index
1 publications
21 citations
Laboratoire d’Informatique et Systèmes
Marseille, France
1 h-index
1 publications
21 citations
Institut Municipal D'Informática de Barcelona
Barcelona, Spain
1 h-index
2 publications
20 citations

University of Milano-Bicocca
Milan, Italy
1 h-index
5 publications
105 citations
1–7 of 7
1 publications · 12 citations
1
h-index
1 publications · 21 citations
1
h-index
Repository · 1 publications · 12 citations
1
h-index
1 publications · 10 citations
1
h-index
1–4