Computational Complexity
Computational Complexity is the branch of theoretical computer science that classifies computational problems according to their inherent difficulty in terms of the resources, particularly time and space, required to solve them using algorithms.
16.3K
Publications
1.1M
Citations
18K
Authors
3.3K
Institutions
Publications per year
2017–2026
1.9K
Variants
Computational Complexity Theory
16.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
Makoto Matsumoto, Takuji Nishimura · ACM Transactions on Modeling and Computer Simulation · 1998 · 5.7K citations
1–5 of 16.3K
18K
36
h-index
34
h-index
34
h-index
34
h-index
University of California San Diego, United States
54 publications · 6.5K citations
32
h-index
1–5 of 18K
3.3K
Massachusetts Institute of Technology
Cambridge, United States
101 h-index
618 publications
82.8K citations
University of California, Berkeley
Berkeley, United States
93 h-index
485 publications
57K citations
Stanford University
Stanford, United States
88 h-index
437 publications
69K citations
Princeton University
Princeton, United States
72 h-index
350 publications
32.4K citations
University of California San Diego
San Diego, United States
72 h-index
281 publications
30K citations

Tel Aviv University
Tel Aviv, Israel
69 h-index
450 publications
31.3K citations

Cornell University
Ithaca, United States
67 h-index
231 publications
18.1K citations

University of Toronto
Toronto, Canada
63 h-index
311 publications
29.8K citations
1–8 of 3.3K
826 publications · 90.7K citations
135
h-index
JACM · 307 publications · 49.1K citations
101
h-index
237 publications · 27.8K citations
79
h-index
531 publications · 34.5K citations
79
h-index
314 publications · 34.7K citations
75
h-index
1–5