Keyword

#P-completeness

Description: A property of computational problems that are complete for the complexity class P under an appropriate reduction, capturing their parallel computation difficulty.
Wikidata ID: wiki/Q905789
OpenAlex ID: keywords/p-completeness
1979 · L.G. Valiant · ACM eBooks · 2,750
1987 · Christos H. Papadimitriou, John N. Tsitsiklis · Mathematics of Operations Research · 1,345
2006 · Nilesh Dalvi, Dan Suciu · The VLDB Journal · 974
1977 · Oscar H. Ibarra, Chul E. Kim · Journal of the ACM · 795
1983 · J. Scott Provan, Michael O. Ball · SIAM Journal on Computing · 752
1996 · Choice Reviews Online · 412
2007 · Norbert Schuch, Michael M. Wolf, et al. · Physical Review Letters · 346
1988 · Richard M. Karp · UC Berkeley · 322
1991 · Alejandro A. Schäffer · SIAM Journal on Computing · 307
1991 · Graham Brightwell, Peter Winkler · Order · 285
1976 · Neil D. Jones, William T. Laaser · Theoretical Computer Science · 285
2001 · Salil P. Vadhan · SIAM Journal on Computing · 250
2004 · Nilesh Dalvi, Dan Suciu · Elsevier eBooks · 243
2000 · Martin Dyer, Catherine Greenhill · Random Structures and Algorithms · 233
1986 · Robert W. Irving, Paul Leather · SIAM Journal on Computing · 227
1977 · Leslie M. Goldschlager · ACM SIGACT News · 223
2002 · Dimitris Fotakis, Spyros Kontogiannis, et al. · Lecture notes in computer science · 215
2008 · Andrei A. Bulatov · Journal of the ACM · 210
2005 · Ullrich Hustadt, Boris Motik, et al. · Research Explorer (The University of Manchester) · 208
2003 · Martin Dyer, Leslie Ann Goldberg, et al. · Algorithmica · 201
1996 · Nadia Creignou, Miki Hermann · Information and Computation · 198
2004 · Guizhen Yang · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · 186
1991 · Graham Brightwell, Peter Winkler · ACM Symposium on Theory of Computing (STOC) · 179
2004 · Tian Sang, Fahiem Bacchus, et al. · Theory and Applications of Satisfiability Testing · 175
Works count: 1,332
Citation count: 25,070
Year
Topic
Type