A second step towards circuit complexity-theoretic analogs of Rice's theorem
Rice's Theorem states that every nontrivial language property of the recursively enumerable sets is undecidable. Borchert and Stephan [BS97] initiated the search for circuit complexity-theoretic analogs of Rice's Theorem. In particular, they proved that every nontrivial counting property of circuits is UP-hard, and that a number of closely related problems are SPP-hard.
The present paper studies whether their UP-hardness result itself can be improved to SPP-hardness. We show that their UP-hardness result cannot be strengthened to SPP-hardness unless unlikely complexity class containments hold. Nonetheless, we prove that every P-constructibly bi-infinite counting property of circuits is SPP-hard. We also raise their general lower bound from unambiguous nondeterminism to constant-ambiguity nondeterminism.
Unable to display preview. Download preview PDF.
- [Bei89]R. Beigel. On the relativized power of additional accepting paths. In Proceedings of the 4th Structure in Complexity Theory Conference, pages 216–224. IEEE Computer Society Press, June 1989.Google Scholar
- [For97]L. Fortnow. Counting complexity. In L. Hemaspaandra and A. Selman, editors, Complexity Theory Retrospective II, pages 81–107. Springer-Verlag, 1997.Google Scholar
- [GJ79]M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.Google Scholar
- [HR97]L. Hemaspaandra and J. Rothe. Complexity-theoretic analogs of Rice's Theorem. Technical Report TR-662, Department of Computer Science, University of Rochester, Rochester, NY, July 1997.Google Scholar
- [HZ93]L. Hemaspaandra and M. Zimand. Strong forms of balanced immunity. Technical Report TR-480, Department of Computer Science, University of Rochester, Rochester, NY, December 1993. Revised May, 1994.Google Scholar
- [Tod91]S. Toda. Computational Complexity of Counting Complexity Classes. PhD thesis, Department of Computer Science, Tokyo Institute of Technology, Tokyo, Japan, 1991.Google Scholar
- [Vol94]H. Vollmer. Komplexitätsklassen von Funktionen. PhD thesis, Institut für Informatik, Universität Würzburg, Würzburg, Germany, 1994.Google Scholar