Skip to search formSkip to main contentSkip to account menu

PSPACE

Known as: PSPACE-hard, NPSPACE, Polynomial space 
In computational complexity theory, PSPACE is the set of all decision problems that can be solved by a Turing machine using a polynomial amount of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
AC0Arthur–Merlin protocolBQPCTL*

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Local Analysis of the Local Discontinuous Galerkin Method with Generalized Alternating Numerical Flux for One-Dimensional Singularly Perturbed Problem
In this paper we would like to present the local analysis of the local discontinuous Galerkin method based on the generalized… 
2013
2013
Constructing Nested Nodal Sets for Multivariate Polynomial Interpolation
We present a robust method for choosing multivariate polynomial interpolation nodes. Our algorithm is an optimization method to… 
Highly Cited
2011
Highly Cited
2011
New Parameterized Algorithms for the Edge Dominating Set Problem
An edge dominating set of a graph G = (V, E) is a subset M ⊆ E of edges in the graph such that each edge in E - M is incident… 
2008
2008
Proof systems for the coalgebraic cover modality
We investigate an alternative presentation of classical and pos- itive modal logic where the coalgebraic cover modality is taken… 
2001
2001
A formal testing framework for UML statechart diagrams behaviours: from theory to automatic verification
We propose a formal testing framework for a behavioural subset of UML statechart diagrams (UMLSDs). A formal operational… 
2001
2001
Strategies of Structural Synthesis of Programs and its Extensions
Proof search for the structural synthesis of programs (SSP) - a deductive program synthesis method which is suited for… 
1992
1992
Locally Definable Acceptance Types - The Three-Valued Case
We consider polynomial time nondeterministic machines, and augment the nodes of the tree associated with a computation by… 
1990
1990
Computational structure of human language
words are rewritten as segmental strings in the interface between syntax and phonology (see chapter 3). The derivation of… 
1988
1988
Relativized Alternation and Space-Bounded Computation
  • J. Buss
  • Journal of computer and system sciences (Print)
  • 1988
  • Corpus ID: 8161929
1987
1987
PSPACE Survives Three-Bit Bottlenecks
Barrington recently discovered that polynomial-size logarithmic-depth circuits are equivalent to constant-width branching… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)