Polynomial Time Complexity
Polynomial Time Complexity is a computational complexity class that characterizes the set of decision problems solvable by a deterministic Turing machine in time bounded by a polynomial function of the input size.
7K
Publications
440.2K
Citations
10.7K
Authors
2.1K
Institutions
Publications per year
2017–2026
1.1K
Variants
Polynomial Time
7K
Graph-Based Algorithms for Boolean Function Manipulation
Bryant · IEEE Transactions on Computers · 1986 · 8.9K citations · Full text
The complexity of theorem-proving procedures
Stephen Cook · 1971 · 6.2K citations · Full text
A new polynomial-time algorithm for linear programming
Narendra Karmarkar · COMBINATORICA · 1984 · 4.8K citations
1–5 of 7K
10.7K
23
h-index
21
h-index
21
h-index
19
h-index
19
h-index
1–5 of 10.7K
2.1K
Massachusetts Institute of Technology
Cambridge, United States
71 h-index
293 publications
44.1K citations
University of California, Berkeley
Berkeley, United States
67 h-index
233 publications
25.1K citations

Cornell University
Ithaca, United States
52 h-index
164 publications
17.9K citations
Carnegie Mellon University
Pittsburgh, United States
51 h-index
242 publications
27.3K citations
Stanford University
Stanford, United States
48 h-index
181 publications
13.2K citations

Tel Aviv University
Tel Aviv, Israel
47 h-index
152 publications
12.4K citations
Microsoft (United States)
Redmond, United States
43 h-index
116 publications
8.5K citations
Princeton University
Princeton, United States
42 h-index
144 publications
12.9K citations
1–8 of 2.1K
331 publications · 41K citations
97
h-index
JACM · 131 publications · 25.4K citations
74
h-index
Repository · 311 publications · 9.4K citations
43
h-index
76 publications · 9.7K citations
40
h-index
72 publications · 7.8K citations
39
h-index
1–5