Results 1  10
of
436
QIP = PSPACE
, 2010
"... We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a parallelized form of the matrix multiplicative weights update method to a class of semidefinite programs that captures the ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a parallelized form of the matrix multiplicative weights update method to a class of semidefinite programs that captures
NonDeterministic Exponential Time has TwoProver Interactive Protocols
"... We determine the exact power of twoprover interactive proof systems introduced by BenOr, Goldwasser, Kilian, and Wigderson (1988). In this system, two allpowerful noncommunicating provers convince a randomizing polynomial time verifier in polynomial time that the input z belongs to the language ..."
Abstract

Cited by 416 (37 self)
 Add to MetaCart
to the language L. It was previously suspected (and proved in a relativized sense) that coNPcomplete languages do not admit such proof systems. In sharp contrast, we show that the class of languages having twoprover interactive proof systems is nondeterministic exponential time. After the recent results
Measuring in PSPACE
 IN PROCEEDINGS OF THE INTERNATIONAL MEETING OF YOUNG COMPUTER SCIENTISTS '92
"... Results of the kind "Almost every oracle in exponential space separates P from NP" or "Almost every set in exponential time is Pbiimmune" can be precisely formulated via a new approach in Structural Complexity recently introduced by Lutz. He defines a resourcebounded measure i ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
in exponential time and space classes that generalizes Lebesgue measure, a powerful mathematical tool. We investigate here the possibility of extending this resourcebounded measure to other classes, mainly PSPACE. We prove here that the natural candidate of a resource bound for measuring in PSPACE is not valid
On IP=PSPACE and theorems with narrow proofs
 EATCS Bulletin
"... It has been shown that the class of languages with interactive proofs, IP, is exactly the class PSPACE. This surprising result elegantly places IP in the standard classification of feasible computations. Furthermore, the IP = PSPACE result reveals some very interesting and unsuspected properties of ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
It has been shown that the class of languages with interactive proofs, IP, is exactly the class PSPACE. This surprising result elegantly places IP in the standard classification of feasible computations. Furthermore, the IP = PSPACE result reveals some very interesting and unsuspected properties
On IP = PSPACE and Theorems with Narrow Proofs
, 1990
"... It has been shown that the class of languages with interactive proofs, IP, is exactly the class PSPACE. This surprising result elegantly places IP in the standard classification of feasible computations. Furthermore, the IP = PSPACE result reveals some very interesting and unsuspected properties of ..."
Abstract
 Add to MetaCart
It has been shown that the class of languages with interactive proofs, IP, is exactly the class PSPACE. This surprising result elegantly places IP in the standard classification of feasible computations. Furthermore, the IP = PSPACE result reveals some very interesting and unsuspected properties
Grammatical characterizations of P and PSPACE
 Transactions of the IEICE, E
, 1990
"... SUMMARY The notion of alternating contextfree grammar (ACFG for short) was introduced by Moriya in 1989. In this paper, we study the relationships between some complexity classes and the classes of languages generated by restricted types of ACFG’s. Two restricted types of ACFG’s considered are lin ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
}. The main results of the present paper are as follows: (1) the class of languages that are logspace manyone reducible to languages in $ACFL_{linear}$ is equivalent to $P $ , and (2) the class of languages that are logspace manyone reducible to languages in $ACFL_{\epsilon}^{le}$ is equivalent to PSPACE
PSPACES AND THE WHYBURN PROPERTY
, 2011
"... We investigate the Whyburn and weakly Whyburn property in the class of Pspaces, that is spaces where every countable intersection of open sets is open. We construct examples of nonweakly Whyburn Pspaces of size continuum, thus giving a negative answer under CH to a question of Pelant, Tkachenko, ..."
Abstract
 Add to MetaCart
We investigate the Whyburn and weakly Whyburn property in the class of Pspaces, that is spaces where every countable intersection of open sets is open. We construct examples of nonweakly Whyburn Pspaces of size continuum, thus giving a negative answer under CH to a question of Pelant, Tkachenko
PSpace Automata for Description Logics
"... Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity results. We examine conditions under which this result can be improved, and we define two classes of automata, called segmentable and weaklysegmentable, for which empti ..."
Abstract
 Add to MetaCart
Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity results. We examine conditions under which this result can be improved, and we define two classes of automata, called segmentable and weaklysegmentable, for which
DAGwidth is PSPACEcomplete
, 2014
"... Berwanger et al. show in [BDH+12] that for every graph G of size n and DAGwidth k there is a DAG decomposition of width k of size nO(k). This gives a polynomial time algorithm for determining the DAGwidth of a graph for any fixed k. However, if the DAGwidth of the graphs from a class is not boun ..."
Abstract
 Add to MetaCart
Berwanger et al. show in [BDH+12] that for every graph G of size n and DAGwidth k there is a DAG decomposition of width k of size nO(k). This gives a polynomial time algorithm for determining the DAGwidth of a graph for any fixed k. However, if the DAGwidth of the graphs from a class
Monotonicity Constraints in Characterisations of PSPACE
"... A celebrated contribution of Bellantoni and Cook was a function algebra to capture FPTIME. This algebra uses recursion on notation. Later, Oitavem showed that including primitive recursion, an algebra is obtained which captures FPSPACE. The main results of this paper concern variants of the latter a ..."
Abstract
 Add to MetaCart
function algebras, arises by combining monotonicity constraints with a known characterisation of PSPACE. Key words: complexity classes, implicit characterisations, recursion schemes 1
Results 1  10
of
436