Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
PSPACE-completeness
Description:
The property of a computational problem being in PSPACE and at least as hard as every problem in that complexity class.
Related topics:
semigroups and automata theory (15%),
Logic, Reasoning, and Knowledge (15%),
Advanced Graph Theory Research (14%),
Formal Methods in Verification (13%),
Complexity and Algorithms in Graphs (8%)
OpenAlex ID:
keywords/pspace-completeness
A theory of timed automata
1994
·
Rajeev Alur
, David L. Dill
·
Theoretical Computer Science
·
6,661
The Complexity of Markov Decision Processes
1987
·
Christos H. Papadimitriou
, John N. Tsitsiklis
·
Mathematics of Operations Research
·
1,345
Optimal implementation of conjunctive queries in relational data bases
1977
·
Ashok K. Chandra
, Philip M. Merlin
·
ACM Symposium on Theory of Computing (STOC)
·
1,328
PDF
Semantics and complexity of SPARQL
2009
·
Jorge Pérez
, Marcelo Arenas
, et al.
·
ACM Transactions on Database Systems
·
1,207
The complexity of propositional linear temporal logics
1985
·
A. P. Sistla
, E. M. Clarke
·
Journal of the ACM
·
1,125
PDF
Attributive concept descriptions with complements
1991
·
Manfred Schmidt-Schauß
, Gert Smolka
·
Artificial Intelligence
·
974
The computational complexity of propositional STRIPS planning
1994
·
Tom Bylander
·
Artificial Intelligence
·
873
A guide to completeness and complexity for modal logics of knowledge and belief
1992
·
Joseph Y. Halpern
, Yoram Moses
·
Artificial Intelligence
·
837
Reasoning about Infinite Computations
1994
·
M.Y. Vardi
, P. Wolper
·
Information and Computation
·
820
Simple On-the-fly Automatic Verification of Linear Temporal Logic
1996
·
R. Gerth
, D. Peled
, et al.
·
IFIP advances in information and communication technology
·
726
PDF
Some algebraic and geometric computations in PSPACE
1988
·
John Canny
·
ACM Symposium on Theory of Computing (STOC)
·
628
PDF
CCS expressions, finite state processes, and three problems of equivalence
1990
·
Paris C. Kanellakis
, Scott A. Smolka
·
Information and Computation
·
530
A Modal Logic for Coalitional Power in Games
2002
·
M. Pauly
·
Journal of Logic and Computation
·
486
A correspondence theory for terminological logics: preliminary report
1991
·
Klaus Schild
·
OpenGrey (Institut de l'Information Scientifique et Technique)
·
466
Shortest paths without a map
1991
·
Christos H. Papadimitriou
, Mihalis Yannakakis
·
Theoretical Computer Science
·
425
Linear temporal logic and linear dynamic logic on finite traces
2013
·
Giuseppe De Giacomo
, Moshe Y. Vardi
·
Rice Research Repository (Rice University)
·
421
Semantics and Complexity of SPARQL
2006
·
Jorge Pérez
, Marcelo Arenas
, et al.
·
Lecture notes in computer science
·
401
Exact and approximate algorithms for partially observable markov decision processes
1998
·
Leslie Pack Kaelbling
, Anthony R. Cassandra
·
366
PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
2005
·
Robert A. Hearn
, Erik D. Demaine
·
Theoretical Computer Science
·
346
PDF
Foundations of SPARQL query optimization
2010
·
Michael Schmidt
, Michael Meier
, et al.
·
International Conference on Database Theory
·
329
Alternating refinement relations
1998
·
Rajeev Alur
, Thomas A. Henzinger
, et al.
·
Lecture notes in computer science
·
320
Testing finite-state machines: state identification and verification
1994
·
D. Lee
, M. Yannakakis
·
IEEE Transactions on Computers
·
313
On the complexity of reconfiguration problems
2010
·
Takehiro Ito
, Erik D. Demaine
, et al.
·
Theoretical Computer Science
·
307
PDF
Towards Formal Analysis of Artifact-Centric Business Process Models
2007
·
Kamal Bhattacharya
, Cagdas Gerede
, et al.
·
Springer eBooks
·
288
Inclusion dependencies and their interaction with functional dependencies
1984
·
Marco A. Casanova
, Ronald Fagin
, et al.
·
Journal of Computer and System Sciences
·
264
Show more works
View as search
Works count:
3,045
Citation count:
58,340
Year
Topic
Type