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
Parents
7
Arithmetical representations of Brownian motion I
Willem L. Fouché · Journal of Symbolic Logic · 2000 · 45 citations
Mikołaj Bojańczyk, Bartek Klin, Sławomir Lasota et al. · 2013 · 30 citations
1–5 of 7
18
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 18
11
Universidade de São Paulo
São Paulo, Brazil
2 h-index
5 publications
74 citations
Université d'Artois
Arras, France
1 h-index
2 publications
96 citations
Tsinghua University
Beijing, China
1 h-index
2 publications
24 citations
Université de Lille
Lille, France
1 h-index
1 publications
48 citations

Tata Institute of Fundamental Research
Mumbai, India
1 h-index
3 publications
153 citations
Laboratoire Paul Painlevé
Villeneuve-d'Ascq, France
1 h-index
1 publications
48 citations

University of Warsaw
Warsaw, Poland
1 h-index
4 publications
120 citations

University of Pretoria
Pretoria, South Africa
1 h-index
1 publications
45 citations
1–8 of 11
1 publications · 16 citations
1
h-index
1 publications · 13 citations
1
h-index
Repository · 1 publications · 48 citations
1
h-index
1 publications · 12 citations
1
h-index
1 publications · 45 citations
1
h-index
1–5