Abstract
New self-reducibility structures are proposed to deal with sets outside the class PSPACE and with sets in logarithmic space complexity classes. General properties derived from the definition are used to prove known results comparing uniform and nonuniform complexity classes and to obtain new ones regarding deterministic time classes, nondeterministic space classes, and reducibility to context-free languages. © 1990.
Cite
CITATION STYLE
APA
Balcázar, J. L. (1990). Self-reducibility. Journal of Computer and System Sciences, 41(3), 367–388. https://doi.org/10.1016/0022-0000(90)90025-G
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free