Complexity Theory
Complexity Theory is a branch of theoretical computer science that classifies computational problems according to their inherent difficulty and relates these classes to one another based on the resources required for their solution.
4.3K
Publications
328.5K
Citations
5.5K
Authors
1.7K
Institutions
Publications per year
2017–2026
438
Variants
Computational Complexity Theory
Parents
4.3K
The Complexity of Intersectionality
Leslie McCall · Signs · 2005 · 6.5K citations
The complexity of theorem-proving procedures
Stephen Cook · 1971 · 6.2K citations · Full text
Thomas J. McCabe · IEEE Transactions on Software Engineering · 1976 · 5.8K citations
1–5 of 4.3K
5.5K
19
h-index
19
h-index
University of California San Diego, United States
21 publications · 4.1K citations
19
h-index
19
h-index
15
h-index
1–5 of 5.5K
1.7K
Massachusetts Institute of Technology
Cambridge, United States
42 h-index
108 publications
18.2K citations
University of California, Berkeley
Berkeley, United States
37 h-index
92 publications
7.3K citations

University of Toronto
Toronto, Canada
37 h-index
90 publications
13.9K citations

Cornell University
Ithaca, United States
34 h-index
78 publications
6.5K citations

Centre National de la Recherche Scientifique
Paris, France
32 h-index
111 publications
5.6K citations
Stanford University
Stanford, United States
32 h-index
62 publications
9.3K citations
University of California San Diego
San Diego, United States
31 h-index
64 publications
11.2K citations
Carnegie Mellon University
Pittsburgh, United States
29 h-index
68 publications
6.6K citations
1–8 of 1.7K
151 publications · 18.9K citations
60
h-index
157 publications · 10.6K citations
47
h-index
JACM · 67 publications · 9.6K citations
44
h-index
86 publications · 11K citations
44
h-index
CRO · 36 publications · 9.3K citations
28
h-index
1–5