Robustness of PSPACE-complete sets

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 EXPcomplete sets [3] and NP-complete sets [7]. Key words: Computational Complexity, Complete Sets, Robustness, P-selective Sets, PSPACE.

• Type: Journal
• Year: 2007
• Where: IPL
• Authors: Aduri Pavan, Fengming Wang
• Keywords: IPL 2007, NP-complete Sets, P-selective Sparse Sets, Robustness