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
Parents
8
Mikołaj Bojańczyk, Bartek Klin, Sławomir Lasota et al. · 2013 · 30 citations
Existential second-order logic over graphs
Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick · Journal of the ACM · 2004 · 29 citations
Descriptive complexity and the W hierarchy.
Rodney G. Downey, Michael R. Fellows, Kenneth W. Regan · 1996 · 28 citations
Noun phrase complexity in Ghanaian English
Thorsten Brato · World Englishes · 2020 · 19 citations · Full text
1–5 of 8
15
University at Buffalo, State University of New York, United States
1 publications · 28 citations
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 15
11

University of Helsinki
Helsinki, Finland
1 h-index
2 publications
26 citations

TU Wien
Vienna, Austria
1 h-index
1 publications
29 citations
Lawrence University
Appleton, United States
1 h-index
1 publications
11 citations
Philipps University of Marburg
Marburg, Germany
1 h-index
1 publications
29 citations
Duke University
Durham, United States
1 h-index
1 publications
28 citations
University of California, Santa Cruz
Santa Cruz, United States
1 h-index
1 publications
29 citations

Hokkaido University
Sapporo, Japan
1 h-index
1 publications
13 citations

University of Warsaw
Warsaw, Poland
1 h-index
4 publications
120 citations
1–8 of 11
JACM · 1 publications · 29 citations
1
h-index
1 publications · 28 citations
1
h-index
WE · 1 publications · 19 citations
1
h-index
1 publications · 12 citations
1
h-index
1–4