Structural Properties Of Complexity Classes
Structural Properties of Complexity Classes is a theoretical framework in computational complexity theory that investigates the intrinsic algebraic, logical, and combinatorial characteristics—such as completeness, closure, and hierarchy—defining the internal organization and interrelationships of complexity classes.
320
Publications
13.9K
Citations
465
Authors
278
Institutions
Publications per year
2017–2026
15
Parents
320
Determining computational complexity from characteristic ‘phase transitions’
Rémi Monasson, Riccardo Zecchina, Scott Kirkpatrick et al. · Nature · 1999 · 803 citations
Complexity classes in communication complexity theory
László Babai, Péter Frankl, Janoš Šimon · 1986 · 318 citations · Full text
Francis Heylighen, Johan Bollen, Alexander Riegler · VUBIR (Vrije Universiteit Brussel) · 1999 · 313 citations
Complexity of deciding Tarski algebra
D. Yu. Grigor'ev · Journal of Symbolic Computation · 1988 · 206 citations
1–5 of 320
465
7
h-index
6
h-index
5
h-index
5
h-index
5
h-index
1–5 of 465
278

Cornell University
Ithaca, United States
15 h-index
32 publications
3K citations
University of Chicago
Chicago, United States
10 h-index
22 publications
1.6K citations
University of California, Berkeley
Berkeley, United States
8 h-index
8 publications
232 citations

University of Auckland
Auckland, New Zealand
7 h-index
12 publications
580 citations
IBM (United States)
Armonk, United States
6 h-index
7 publications
1.1K citations
Universitat Politècnica de Catalunya
Barcelona, Spain
6 h-index
8 publications
283 citations

University of Massachusetts Amherst
Amherst Center, United States
6 h-index
8 publications
428 citations

École Normale Supérieure de Lyon
Lyon, France
5 h-index
8 publications
247 citations
1–8 of 278
29 publications · 1.1K citations
19
h-index
20 publications · 1.2K citations
16
h-index
11 publications · 412 citations
11
h-index
11 publications · 266 citations
10
h-index
13 publications · 515 citations
10
h-index
1–5