Structural Complexity
Structural Complexity is a subfield of computational complexity theory that investigates the inherent relationships among complexity classes, reducibilities, and completeness to understand the internal structure of computational problems.
3.4K
Publications
208.9K
Citations
5.1K
Authors
1.7K
Institutions
Publications per year
2017–2026
383
3.4K
Thomas J. McCabe · IEEE Transactions on Software Engineering · 1976 · 5.8K citations
Complexity: The emerging science at the edge of order and chaos
Long Range Planning · 1996 · 2.1K citations
Universality and complexity in cellular automata
Stephen Wolfram · Physica D Nonlinear Phenomena · 1984 · 1.9K citations
Computing, Mathematics, Algorithms +11
1–5 of 3.4K
5.1K
University at Buffalo, State University of New York, United States
18 publications · 1.3K citations
16
h-index
14
h-index
13
h-index
13
h-index
12
h-index
1–5 of 5.1K
1.7K

Centre National de la Recherche Scientifique
Paris, France
33 h-index
125 publications
4.4K citations
Massachusetts Institute of Technology
Cambridge, United States
32 h-index
76 publications
8.4K citations

Cornell University
Ithaca, United States
26 h-index
72 publications
4.9K citations
University of Chicago
Chicago, United States
25 h-index
54 publications
5.4K citations
Carnegie Mellon University
Pittsburgh, United States
24 h-index
48 publications
5.2K citations

University of Toronto
Toronto, Canada
23 h-index
49 publications
2.2K citations
University of California San Diego
San Diego, United States
22 h-index
48 publications
4.6K citations
University of Oxford
Oxford, United Kingdom
22 h-index
58 publications
2.5K citations
1–8 of 1.7K
163 publications · 7.6K citations
44
h-index
84 publications · 8K citations
41
h-index
58 publications · 6.8K citations
32
h-index
51 publications · 2.4K citations
29
h-index
72 publications · 2.3K citations
29
h-index
1–5