Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
PSPACE-hardness
Description:
The property of a computational problem being at least as hard as every problem in PSPACE under polynomial-time reductions.
Related topics:
Formal Methods in Verification (14%),
Complexity and Algorithms in Graphs (12%),
Advanced Graph Theory Research (11%),
semigroups and automata theory (10%),
Logic, programming, and type systems (8%)
OpenAlex ID:
keywords/pspace-hardness
The NP-completeness column: An ongoing guide
1986
·
David S Johnson
·
Journal of Algorithms
·
799
On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem"
1984
·
J.E. Hopcroft
, J.T. Schwartz
, et al.
·
The International Journal of Robotics Research
·
528
The size-change principle for program termination
2001
·
Chin Soon Lee
, Neil D. Jones
, et al.
·
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)
·
457
Computational complexity of stochastic programming problems
2005
·
Martin Dyer
, Leen Stougie
·
Mathematical Programming
·
293
New complexity results about Nash equilibria
2008
·
Vincent Conitzer
, Tuomas Sandholm
·
Games and Economic Behavior
·
279
Complexity Results about Nash Equilibria
2002
·
Conitzer, Vincent
, Sandholm, Tuomas
·
arXiv (Cornell University)
·
241
PDF
Pushing the EL Envelope Further.
2008
·
Franz Baader
, Carsten Lutz
, et al.
·
238
Query containment for conjunctive queries with regular expressions
1998
·
Daniela Florescu
, Alon Levy
, et al.
·
ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS)
·
208
GO Is Polynomial-Space Hard
1980
·
David Lichtenstein
, Michael Sipser
·
Journal of the ACM
·
206
PDF
Motion planning in the presence of moving obstacles
1994
·
John Reif
, Micha Sharir
·
Journal of the ACM
·
203
PDF
Motion planning in the presence of moving obstacles
1985
·
John Reif
, Micha Sharir
·
Annual Symposium on Foundations of Computer Science
·
200
Navigation among movable obstacles: real-time reasoning in complex environments
2005
·
M. Stilman
, J. Kuffner
·
IEEE-RAS International Conference on Humanoid Robots (Humanoids)
·
190
Recurring Dominoes: Making the Highly Undecidable Highly Understandable
1985
·
David Harel
·
North-Holland mathematics studies
·
185
Motion planning in the presence of movable obstacles
1988
·
G. Wilfong
·
Annual Symposium on Computational Geometry (SoCG)
·
172
PDF
Compaction and separation algorithms for non-convex polygons and their applications
1995
·
Zhenyu Li
, Victor Milenkovic
·
European Journal of Operational Research
·
160
Verification of Infinite-Step Opacity and Complexity Considerations
2011
·
Anooshiravan Saboori
, Christoforos N. Hadjicostis
·
IEEE Transactions on Automatic Control
·
157
Hex ist PSPACE-vollst�ndig
1981
·
Stefan Reisch
·
Acta Informatica
·
153
Approximation algorithms for restless bandit problems
2010
·
Sudipto Guha
, Kamesh Munagala
, et al.
·
Journal of the ACM
·
148
PDF
The NP-completeness column: An ongoing guide
1982
·
David S Johnson
·
Journal of Algorithms
·
146
Nonexistence of Voting Rules That Are Usually Hard to Manipulate
2018
·
Conitzer, Vincent
, Sandholm, Tuomas W
·
KiltHub Repository
·
140
A safe approximate algorithm for interprocedural aliasing
1992
·
William Landi
, Barbara G. Ryder
·
ACM SIGPLAN Notices
·
133
Universal Voting Protocol Tweaks to Make Manipulation Hard
2003
·
Conitzer, Vincent
, Sandholm, Tuomas W
·
arXiv (Cornell University)
·
125
PDF
Deciding ML typability is complete for deterministic exponential time
1990
·
Harry G. Mairson
·
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)
·
121
PDF
Motion planning in the presence of movable obstacles
1991
·
Gordon Wilfong
·
Annals of Mathematics and Artificial Intelligence
·
119
Movement Problems for 2-Dimensional Linkages
1984
·
John Hopcroft
, Deborah Joseph
, et al.
·
SIAM Journal on Computing
·
110
Show more works
View as search
Works count:
727
Citation count:
14,200
Year
Topic
Type