Time Complexity
Time Complexity is a computational complexity measure that belongs to the class of resource-bounded complexity measures, specifically characterized by the amount of time required by an algorithm to solve a problem as a function of the input size.
2.5K
Publications
144.1K
Citations
3.3K
Authors
1.1K
Institutions
Publications per year
2017–2026
335
2.5K
The complexity of computing the permanent
Leslie G. Valiant · Theoretical Computer Science · 1979 · 2.8K citations
The Complexity of Flowshop and Jobshop Scheduling
M. R. Garey, David Johnson, Ravi Sethi · Mathematics of Operations Research · 1976 · 2.6K citations
How to construct random functions
Oded Goldreich, Shafi Goldwasser, Silvio Micali · Journal of the ACM · 1986 · 2.1K citations · Full text
From Being to Becoming: Time and Complexity in the Physical Sciences
George A. Agoston, Ilya Prigogine · Leonardo · 1982 · 1.2K citations
1–5 of 2.5K
3.3K
19
h-index
17
h-index
16
h-index
16
h-index
16
h-index
1–5 of 3.3K
1.1K
Stanford University
Stanford, United States
34 h-index
96 publications
12.4K citations
University of California, Berkeley
Berkeley, United States
32 h-index
78 publications
6.7K citations

Tel Aviv University
Tel Aviv, Israel
30 h-index
88 publications
6K citations
Massachusetts Institute of Technology
Cambridge, United States
29 h-index
83 publications
12.9K citations

University of Toronto
Toronto, Canada
26 h-index
49 publications
4.8K citations
Carnegie Mellon University
Pittsburgh, United States
26 h-index
44 publications
3K citations
Princeton University
Princeton, United States
25 h-index
65 publications
4.9K citations

University of Waterloo
Waterloo, Canada
25 h-index
42 publications
2.2K citations
1–8 of 1.1K
204 publications · 16.6K citations
70
h-index
JACM · 61 publications · 9.4K citations
43
h-index
101 publications · 8.4K citations
39
h-index
57 publications · 6.9K citations
32
h-index
Repository · 84 publications · 2.2K citations
26
h-index
1–5