Keyword

PSPACE-complete problems

Description: Computational problems that belong to PSPACE and are at least as hard as every problem in PSPACE under polynomial-time reductions.
OpenAlex ID: keywords/pspace-complete-problems
2007 · Luca Trevisan, Salil Vadhan · Computational Complexity · 130
2010 · Tseren-Onolt Ishdorj, Alberto Leporati, et al. · Theoretical Computer Science · 126
2003 · Artiom Alhazov, Carlos Martı́n-Vide, et al. · Fundamenta Informaticae · 119
1999 · Ian P. Gent, Toby Walsh · National Conference on Artificial Intelligence · 93
2002 · Lucas Bordeaux, Eric Monfroy · Lecture notes in computer science · 88
2008 · P. Wocjan, J. Yard · Quantum Information and Computation · 87
2006 · Mangassarian, Hratch · 69
2004 · L. Fortnow, R. Santhanam · Annual Symposium on Foundations of Computer Science · 68
2003 · L. Trevisan, S. Vadhan · IEEE Conference on Computational Complexity (CCC) · 68
2018 · Susskind, Leonard · arXiv (Cornell University) · 62
2019 · Petr Sosík · Journal of Membrane Computing · 59
2003 · Todd A. Brun · Foundations of Physics Letters · 59
2011 · Niall Murphy, Damien Woods · Natural Computing · 55
2013 · Richard Mayr, Lorenzo Clemente · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · 52
2011 · Kazuhisa Makino, Suguru Tamaki, et al. · Theoretical Computer Science · 36
2009 · Ami Hauptman, Achiya Elyasaf, et al. · Genetic and Evolutionary Computation Conference (GECCO) · 32
2005 · Miguel A. Gutiérrez-Naranjo, Mario J. Pérez-Jiménez, et al. · Lecture notes in computer science · 29
2019 · Bosheng Song, Yuan Kong · Mathematical Problems in Engineering · 26
2017 · Jean-Marie Lagniez, Daniel Le Berre, et al. · International Joint Conference on Artificial Intelligence · 23
1999 · Ricard Gavaldà, Hava T. Siegelmann · Neural Computation · 21
1993 · M. V. Marathe, H. B. Hunt, et al. · Lecture notes in computer science · 21
2007 · Benedek Nagy, Sándor Vályi · Theoretical Computer Science · 14
Works count: 103
Citation count: 1,696
Year
Topic
Type