107
click to vote
IPL
2007
15 years 3 months ago
2007
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] ...