Robustness of PSPACE-complete sets

doi:10.1016/j.ipl.2007.02.018

Information Processing Letters

Volume 103, Issue 3, 31 July 2007, Pages 102-104

https://doi.org/10.1016/j.ipl.2007.02.018 Get rights and content

Abstract

We study the robustness of complete languages in PSPACE and prove that they are robust against P-selective sparse sets. Earlier similar results are known for EXP-complete sets [H. Buhrman, A. Hoene, L. Torenvliet, Splittings, robustness, and structure of complete sets, SIAM J. Comput. 27 (3) (1998) 637–653] and NP-complete sets [C. Glaßer, A. Pavan, A. Selman, S. Sengupta, Properties of NP-complete sets, in: IEEE Conference on Computational Complexity, 2004, pp. 184–197].

References (11)

D. Barrington
Bounded-width polynomial-size branching programs recognize exactly those languages in ${NC}^{1}$
J. Comput. System Sci.
(1989)
S. Tang et al.
Exponential-time and subexponential-time sets
Theory Comput. Sci.
(1993)
L. Berman, On the structure of complete sets: Almost everywhere complexity and infinitely often speedup, in: IEEE...
H. Buhrman et al.
Splittings, robustness, and structure of complete sets
SIAM J. Comput.
(1998)
H. Buhrman, L. Torenvliet, Separating complexity classes using structural properties, in: IEEE Conference on...

There are more references available in the full text version of this article.

Cited by (0)

¹: This research was supported in part by NSF grant 0430807.

View full text

A new class of two-level optimal extended designs
Journal of the Korean Statistical Society, Volume 45, Issue 2, 2016, pp. 168-175
Hong Qin, …, Kashinath Chatterjee
Orthogonality in locally convex spaces: Two nonlinear generalizations of Neumann's lemma
Journal of Mathematical Analysis and Applications, Volume 484, Issue 1, 2020, Article 123663
Annamaria Barbagallo, …, Michel Théra
Equivariant quantization of Poisson homogeneous spaces and Kostant's problem
Journal of Algebra, Volume 409, 2014, pp. 362-381
E. Karolinsky, …, V. Tarasov
On a Frankl–Rödl theorem and its geometric corollaries
Electronic Notes in Discrete Mathematics, Volume 61, 2017, pp. 1033-1037
A.A. Sagdeev
Matching divisible designs with block size four
Discrete Mathematics, Volume 339, Issue 2, 2016, pp. 790-799
Peter J. Dukes, …, Alan C.H. Ling
Information gathering in ad-hoc radio networks with tree topology
Information and Computation, Volume 258, 2018, pp. 1-27
Marek Chrobak, …, Dariusz R. Kowalski

Robustness of PSPACE-complete sets

Abstract

J. Comput. System Sci.

Theory Comput. Sci.

Splittings, robustness, and structure of complete sets

SIAM J. Comput.