Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

27

IPL
2007

favoriteEmaildiscussreport

60views more IPL 2007»

Robustness of PSPACE-complete sets

13 years 11 months ago

Robustness of PSPACE-complete sets

Download www.cs.iastate.edu

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.

Aduri Pavan, Fengming Wang

Real-time Traffic

IPL 2007 | NP-complete Sets | P-selective Sparse Sets | Robustness |

claim paper

Related Content

» Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities

» The Complexity of Type Analysis of Object Oriented Programs

» Intrinsic SecondOrder Geometric Optimization for Robust Point Set Registration without Cor...

» Robust variable selection using least angle regression and elemental set sampling

» Robust Rigid Shape Registration Method Using a Level Set Formulation

» Consensus set maximization with guaranteed global optimality for robust geometry estimatio...

» Universal Semantic Communication I

» Dynamic Observers for the Synthesis of Opaque Systems

» Using the feasible set method for rezoning in ALE

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2007
Where	IPL
Authors	Aduri Pavan, Fengming Wang

Comments (0)