Computational Complexity Of Algorithms
Computational Complexity of Algorithms is a theoretical framework within computational complexity theory that characterizes the inherent resource requirements, typically time or space, of algorithmic problem-solving as a function of input size, distinguishing it from other complexity measures by focusing on the classification of problems according to their algorithm-specific efficiency.
4.8K
Publications
248.6K
Citations
12.3K
Authors
2.3K
Institutions
Publications per year
2017–2026
1.6K
Parents
4.8K
Efficient Processing of Deep Neural Networks: A Tutorial and Survey
Vivienne Sze, Yu‐Hsin Chen, Tien-Ju Yang et al. · Proceedings of the IEEE · 2017 · 4K citations
Michael R. Fellows · Electronic Notes in Theoretical Computer Science · 2002 · 2.9K citations · Full text
1–5 of 4.8K
12.3K
16
h-index
13
h-index
12
h-index
12
h-index
Nanjing University of Aeronautics and Astronautics, China
13 publications · 554 citations
12
h-index
1–5 of 12.3K
2.3K
Tsinghua University
Beijing, China
34 h-index
253 publications
12.2K citations
Stanford University
Stanford, United States
32 h-index
84 publications
9.2K citations

University of Electronic Science and Technology of China
Chengdu, China
30 h-index
238 publications
11.1K citations
Nanyang Technological University
Singapore, Singapore
28 h-index
125 publications
4.4K citations

City University of Hong Kong
Hong Kong, Hong Kong
27 h-index
79 publications
5.1K citations
Massachusetts Institute of Technology
Cambridge, United States
26 h-index
79 publications
21.2K citations

Xidian University
Xi'an, China
25 h-index
178 publications
4.8K citations

Beijing University of Posts and Telecommunications
Beijing, China
25 h-index
203 publications
6.5K citations
1–8 of 2.3K
169 publications · 9.4K citations
52
h-index
92 publications · 6.4K citations
40
h-index
84 publications · 5.5K citations
39
h-index
102 publications · 3.8K citations
37
h-index
111 publications · 4K citations
35
h-index
1–5