Sciweavers

IPL
2007
60views more  IPL 2007»
14 years 11 days ago
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] ...
Aduri Pavan, Fengming Wang