Robustness of PSPACE-complete sets
References (11)
Bounded-width polynomial-size branching programs recognize exactly those languages in
J. Comput. System Sci.
(1989)- 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...
- 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)
- 1
This research was supported in part by NSF grant 0430807.
Copyright © 2007 Elsevier B.V. All rights reserved.