Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
PSPACE complexity
Description:
A measure of computational difficulty concerning whether a problem can be solved using polynomially bounded memory.
Primary topic:
Logic, Reasoning, and Knowledge (26%)
Related topics:
Logic, Reasoning, and Knowledge (26%),
Formal Methods in Verification (24%),
semigroups and automata theory (12%)
OpenAlex ID:
keywords/pspace-complexity
AI safety via debate
2018
·
Irving, Geoffrey
, Christiano, Paul
, et al.
·
arXiv (Cornell University)
·
694
PDF
Practical Reasoning for Expressive Description Logics
1999
·
Ian Horrocks
, Ulrike Sattler
, et al.
·
Lecture notes in computer science
·
587
PDF
Stochastic Boolean Satisfiability
2001
·
Michael L. Littman
, Stephen M. Majercik
, et al.
·
Journal of Automated Reasoning
·
161
Verifying temporal properties of finite-state probabilistic programs
1988
·
C. Courcoubetis
, M. Yannakakis
·
Annual Symposium on Foundations of Computer Science
·
160
Streaming transducers for algorithmic verification of single-pass list-processing programs
2011
·
Rajeev Alur
, Pavol Černý
·
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)
·
122
Parametric temporal logic for “model measuring”
2001
·
Rajeev Alur
, Kousha Etessami
, et al.
·
ACM Transactions on Computational Logic
·
100
Streaming transducers for algorithmic verification of single-pass list-processing programs
2011
·
Rajeev Alur
, Pavol Černý
·
ACM SIGPLAN Notices
·
92
PDF
PSPACE bounds for rank-1 modal logics
2009
·
LUTZ Schröder
, Dirk Pattinson
·
ACM Transactions on Computational Logic
·
70
PDF
Simultaneous Geometric Graph Embeddings
2008
·
Alejandro Estrella-Balderrama
, Elisabeth Gassner
, et al.
·
Springer eBooks
·
70
A Cut-Free Cyclic Proof System for Kleene Algebra
2017
·
Anupam Das
, Damien Pous
·
Lecture notes in computer science
·
55
PDF
The Logic of Event Clocks - Decidability, Complexity And Expressiveness
1999
·
Raskin, Jean-François
, Schobbens, Pierre-Yves
·
Journal of automata, languages and combinatorics
·
55
Automatic Verification of Abstract State Machines
1999
·
Marc Spielmann
·
Lecture notes in computer science
·
54
PDF
Algorithmic Verification of Recursive Probabilistic State Machines
2005
·
Kousha Etessami
, Mihalis Yannakakis
·
Lecture notes in computer science
·
52
PDF
Visibility graph recognition
1990
·
Hazel Everett
, Derek G. Corneil
·
52
Admissible Rules of Lukasiewicz Logic
2010
·
E. Jerabek
·
Journal of Logic and Computation
·
49
On the Coalgebraic Theory of Kleene Algebra with Tests
2017
·
Dexter Kozen
·
Outstanding contributions to logic
·
48
PDF
Double-Crossing: Decidability and Computational Complexity of a Qualitative Calculus for Navigation
2001
·
Alexander Scivos
, Bernhard Nebel
·
Lecture notes in computer science
·
48
Pure future local temporal logics are expressively complete for Mazurkiewicz traces
2006
·
Volker Diekert
, Paul Gastin
·
Information and Computation
·
47
Multi-objective Discounted Reward Verification in Graphs and MDPs
2013
·
Krishnendu Chatterjee
, Vojtěch Forejt
, et al.
·
Lecture notes in computer science
·
40
Strategies of structural synthesis of programs and its extensions
2001
·
Mihhail Matskin
, Enn Tyugu
·
40
Satisfiability and Model Checking for MSO-Definable Temporal Logics Are in PSPACE
2003
·
Paul Gastin
, Dietrich Kuske
·
Lecture notes in computer science
·
38
Vertex-edge pseudo-visibility graphs: characterization and recognition
1997
·
Joseph O'Rourke
, Ileana Streinu
·
Annual Symposium on Computational Geometry (SoCG)
·
34
PDF
PSPACE Bounds for Rank-1 Modal Logics
2006
·
L. Schroder
, D. Pattinson
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
33
The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity
2001
·
MAX KANOVICH
, JACQUELINE VAUZEILLES
·
Mathematical Structures in Computer Science
·
33
Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces
2010
·
Paul Gastin
, Dietrich Kuske
·
Information and Computation
·
30
PDF
Show more works
View as search
Works count:
225
Citation count:
4,063
Year
Topic
Type