Abstract
Polynomial-time many-one reductions provide the standard notion of completeness for complexity classes. However, as first explicated by Berman and Hartmanis in their work on the isomorphism conjecture, all natural complete problems are actually complete under reductions with stronger properties. We study the length-increasing property and show under various computational hardness assumptions that all PSPACE-complete problems are complete via length-increasing reductions that are computable with a small amount of nonuniform advice.
If there is a problem in PSPACE that requires exponential time, then polynomial size advice suffices to give li-reductions to all PSPACE- complete sets. Under the stronger assumption that linear space requires exponential-size NP-oracle circuits, we reduce the advice to logarithmic size. Our proofs make use of pseudorandom generators, hardness versus randomness tradeoffs, and worst-case to average-case hardness reductions.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Agrawal, M.: Pseudo-random generators and structure of complete degrees. In: Proceedings of the Seventeenth Annual IEEE Conference on Computational Complexity, pp. 139–147. IEEE Computer Society (2002)
Adleman, L., Manders, K.: Reducibility, randomness, and intractability. In: Proceedings of the 9th ACM Symposium on Theory of Computing, pp. 151–163 (1977)
Agrawal, M., Watanabe, O.: One-way functions and the isomorphism conjecture. Technical Report TR09-019, Electronic Colloquium on Computational Complexity (2009)
Berman, L.: Polynomial Reducibilities and Complete Sets. PhD thesis, Cornell University (1977)
Berman, L., Hartmanis, J.: On isomorphism and density of NP and other complete sets. SIAM Journal on Computing 6(2), 305–322 (1977)
Buhrman, H., Hescott, B., Homer, S., Torenvliet, L.: Non-uniform reductions. Theory of Computing Systems 47(2), 317–341 (2010)
Cook, S.A.: The complexity of theorem proving procedures. In: Proceedings of the Third ACM Symposium on the Theory of Computing, pp. 151–158 (1971)
Ganesan, K., Homer, S.: Complete problems and strong polynomial reducibilities. SIAM Journal on Computing 21(4), 733–742 (1992)
Gu, X., Hitchcock, J.M., Pavan, A.: Collapsing and separating complete notions under worst-case and average-case hypotheses. Theory of Computing Systems 51(2), 248–265 (2012)
Hitchcock, J.M., Pavan, A.: Comparing reductions to NP-complete sets. Information and Computation 205(5), 694–706 (2007)
Impagliazzo, R., Wigderson, A.: P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In: Proceedings of the 29th Symposium on Theory of Computing, pp. 220–229 (1997)
Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–104. Plenum Press (1972)
Klivans, A., van Melkebeek, D.: Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. SIAM Journal on Computing 31(5), 1501–1526 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hitchcock, J.M., Pavan, A. (2013). Length-Increasing Reductions for PSPACE-Completeness. In: Chatterjee, K., Sgall, J. (eds) Mathematical Foundations of Computer Science 2013. MFCS 2013. Lecture Notes in Computer Science, vol 8087. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40313-2_48
Download citation
DOI: https://doi.org/10.1007/978-3-642-40313-2_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40312-5
Online ISBN: 978-3-642-40313-2
eBook Packages: Computer ScienceComputer Science (R0)