Separating the Notions of Self- and Autoreducibility
Recently Glaßer et al. have shown that for many classes C including PSPACE and NP it holds that all of its nontrivial many-one complete languages are autoreducible. This immediately raises the question of whether all many-one complete languages are Turing self-reducible for such classes C.
This paper considers a simpler version of this question—whether all PSPACE-complete (NP-complete) languages are length-decreasing self-reducible. We show that if all PSPACE-complete languages are length-decreasing self-reducible then PSPACE = P and that if all NP-complete languages are length-decreasing self-reducible then NP = P.
The same type of result holds for many other natural complexity classes. In particular, we show that (1) not all NL-complete sets are logspace length-decreasing self-reducible, (2) unconditionally not all PSPACE-complete languages are logpsace length-decreasing self-reducible, and (3) unconditionally not all PSPACE-complete languages are polynomial-time length-decreasing self-reducible.
KeywordsTuring Machine Recursive Call Recursion Tree Query String Oracle Query
Unable to display preview. Download preview PDF.
- 1.Meyer, A., Paterson, M.: With what frequency are apparently intractable problems difficult? Technical Report MIT/LCS/TM-126, Laboratory for Computer Science, MIT, Cambridge (1979)Google Scholar
- 2.Schnorr, C.: Optimal algorithms for self-reducible problems. In: Proceedings of the 3rd International Colloquium on Automata, Languages, and Programming, pp. 322–337 (1976)Google Scholar
- 4.Ambos-Spies, K.: P-mitotic sets. In: Logic and Machines, pp. 1–23 (1983)Google Scholar
- 5.Yao, A.: Coherent functions and program checkers. In: Proceedings of the 22nd ACM Symposium on Theory of Computing, pp. 84–94. ACM Press, New York (1990)Google Scholar
- 9.Glaßer, C., Ogihara, M., Pavan, A., Selman, A., Zhang, L.: Autoreducibility, mitoticity, and immunity. Technical Report TR05-011, Electronic Colloquium on Computational Complexity (2005), http://www.eccc.uni-trier.de/eccc/