Keyword

polynomial-time computability

Description: The property of a function or problem being computable by an algorithm whose running time is bounded by a polynomial in input size.
OpenAlex ID: keywords/polynomial-time-computability
1989 · O. Goldreich, L. A. Levin · ACM Symposium on Theory of Computing (STOC) · 1,470
1991 · Ker-I Ko · Birkhäuser Boston eBooks · 638
2006 · Xi Chen, Xiaotie Deng · Annual Symposium on Foundations of Computer Science · 614
2008 · Iris Van Rooij · Cognitive Science · 332
1992 · Jean-Yves Girard, Andre Scedrov, et al. · Theoretical Computer Science · 301
2005 · Constantinos Daskalakis, Christos H. Papadimitriou · Electronic colloquium on computational complexity · 171
1982 · Neil Immerman · ACM Symposium on Theory of Computing (STOC) · 144
2005 · Xi Chen, Xiaotie Deng · Electronic colloquium on computational complexity · 130
1993 · Peter Gritzmann, Victor Klee · Mathematical Programming · 104
1996 · B. M. Kapron, S. A. Cook · SIAM Journal on Computing · 101
1987 · Michael R. Fellows, Michael A. Langston · Information Processing Letters · 100
2001 · Jan Ramon, Maurice Bruynooghe · Acta Informatica · 97
1985 · Ker-I Ko · Theoretical Computer Science · 86
2002 · D. Leviant · ACM/IEEE Symposium on Logic in Computer Science (LICS) · 85
2005 · Luis Antunes, Lance Fortnow, et al. · Theoretical Computer Science · 84
2005 · Dirk Vertigan · SIAM Journal on Computing · 81
1975 · Nancy Lynch · Journal of the ACM · 76
2004 · Peter Bürgisser · Foundations of Computational Mathematics · 75
1983 · Ker-I Ko · Information and Control · 75
2017 · Iskander Kalimullin, Alexander Melnikov, et al. · Theoretical Computer Science · 73
1986 · Uwe Schöning · Theory of Computing Systems · 73
1983 · Ker-I Ko · Theory of Computing Systems · 73
2004 · Kazushige Terui · Studia Logica · 67
1973 · Robert L. Constable · ACM Symposium on Theory of Computing (STOC) · 63
Works count: 518
Citation count: 8,729
Year
Topic
Type