Complexity Classes
Complexity Classes is a formal category in computational complexity theory that classifies computational problems according to the resources, such as time or space, required by algorithms to solve them on abstract machines like Turing machines.
482
Publications
29.9K
Citations
652
Authors
333
Institutions
Publications per year
2017–2026
31
482
Complexity and real computation
Choice Reviews Online · 1998 · 1.3K citations
PP is as Hard as the Polynomial-Time Hierarchy
Seinosuke Toda · SIAM Journal on Computing · 1991 · 677 citations
Quantum-inspired genetic algorithms
A. Narayanan, Matthew Moore · 2002 · 644 citations
Computing, Computer Science, Physics +12
1–5 of 482
652
13
h-index
10
h-index
University at Buffalo, State University of New York, United States
9 publications · 482 citations
9
h-index
Rutgers, The State University of New Jersey, United States
8 publications · 346 citations
8
h-index
8
h-index
1–5 of 652
333
University of California San Diego
San Diego, United States
14 h-index
17 publications
3.2K citations
University of California, Berkeley
Berkeley, United States
14 h-index
16 publications
1.8K citations

Cornell University
Ithaca, United States
13 h-index
30 publications
1.4K citations
Massachusetts Institute of Technology
Cambridge, United States
12 h-index
17 publications
998 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
11 h-index
15 publications
546 citations

University of Rochester
Rochester, United States
10 h-index
14 publications
240 citations

University of Toronto
Toronto, Canada
10 h-index
15 publications
553 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
10 h-index
12 publications
584 citations
1–8 of 333
45 publications · 4.2K citations
27
h-index
25 publications · 911 citations
17
h-index
22 publications · 3.7K citations
17
h-index
JACM · 14 publications · 1.3K citations
14
h-index
12 publications · 424 citations
12
h-index
1–5