# A second step towards circuit complexity-theoretic analogs of Rice's theorem

## Abstract

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.

## Preview

Unable to display preview. Download preview PDF.

## References

- [All86]E. Allender. The complexity of sparse sets in P. In
*Proceedings of the 1st Structure in Complexity Theory Conference*, pages 1–11. Springer-Verlag*Lecture Notes in Computer Science*#*223*, June 1986.zbMATHMathSciNetGoogle Scholar - [AR88]E. Allender and R. Rubinstein. P-printable sets.
*SIAM Journal on Computing*, 17(6): 1193–1202, 1988.zbMATHMathSciNetCrossRefGoogle Scholar - [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 - [BS97]B. Borchert and F. Stephan. Looking for an analogue of Rice's Theorem in circuit complexity theory. In
*Proceedings on the 1997 Kurt Gödel Colloquium*, pages 114–127. Springer-Verlag*Lecture Notes in Computer Science*#*1289*, 1997.zbMATHMathSciNetGoogle Scholar - [CGH+88]J. Cai, T. Gundermann, J. Hartmanis, L. Hemachandra, V. Sewelson, K. Wagner, and G. Wechsung. The boolean hierarchy I: Structural properties.
*SIAM Journal on Computing*, 17(6):1232–1252, 1988.zbMATHMathSciNetCrossRefGoogle Scholar - [CGH+89]J. Cai, T. Gundermann, J. Hartmanis, L. Hemachandra, V. Sewelson, K. Wagner, and G. Wechsung. The boolean hierarchy II: Applications.
*SIAM Journal on Computing*, 18(1):95–111, 1989.zbMATHMathSciNetCrossRefGoogle Scholar - [CH90]J. Cai and L. Hemachandra. On the power of parity polynomial time.
*Mathematical Systems Theory*, 23(2):95–106, 1990.zbMATHMathSciNetCrossRefGoogle Scholar - [FFK94]S. Fenner, L. Fortnow, and S. Kurtz. Gap-definable counting classes.
*Journal of Computer and System Sciences*, 48(1): 116–148, 1994.zbMATHMathSciNetCrossRefGoogle 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 - [GS88]J. Grollmann and A. Selman. Complexity measures for public-key cryptosystems.
*SIAM Journal on Computing*, 17(2):309–335, 1988.zbMATHMathSciNetCrossRefGoogle Scholar - [GW87]T. Gundermann and G. Wechsung. Counting classes with finite acceptance types.
*Computers and Artificial Intelligence*, 6(5):395–409, 1987.zbMATHMathSciNetGoogle Scholar - [HL71]J. Hartmanis and F. Lewis. The use of lists in the study of undecidable problems in automata theory.
*Journal of Computer and System Sciences*, 5(1):54–66, 1971.zbMATHMathSciNetGoogle 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
- [HV95]L. Hemaspaandra and H. Vollmer. The Satanic notations: Counting classes beyond #P and other definitional adventures.
*SIGACT News*, 26(1):2–13, 1995.CrossRefGoogle 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
- [Kar94]J. Kari. Rice's Theorem for the limit sets of cellular automata.
*Theoretical Computer Science*, 127(2):229–254, 1994.zbMATHMathSciNetCrossRefGoogle Scholar - [KSTT92]J. Köbler, U. Schöning, S. Toda, and J. Torán. Turing machines with few accepting computations and low sets for PP.
*Journal of Computer and System Sciences*, 44(2):272–286, 1992.zbMATHMathSciNetCrossRefGoogle Scholar - [OH93]M. Ogiwara and L. Hemachandra. A complexity theory for closure properties.
*Journal of Computer and System Sciences*, 46(3):295–325, 1993.zbMATHMathSciNetCrossRefGoogle Scholar - [Ric53]H. Rice. Classes of recursively enumerable sets and their decision problems.
*Transactions of the AMS*, 74:358–366, 1953.zbMATHMathSciNetCrossRefGoogle Scholar - [Ric56]H. Rice. On completely recursively enumerable classes and their key arrays.
*Journal of Symbolic Logic*, 21:304–341, 1956.zbMATHMathSciNetCrossRefGoogle 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 - [Val76]L. Valiant. The relative complexity of checking and evaluating.
*Information Processing Letters*, 5(1):20–23, 1976.zbMATHMathSciNetCrossRefGoogle Scholar - [Val79]L. Valiant. The complexity of enumeration and reliability problems.
*SIAM Journal on Computing*, 8(3):410–421, 1979.zbMATHMathSciNetCrossRefGoogle Scholar - [Vol94]H. Vollmer.
*Komplexitätsklassen von Funktionen*. PhD thesis, Institut für Informatik, Universität Würzburg, Würzburg, Germany, 1994.Google Scholar - [Wat88]O. Watanabe. On hardness of one-way functions.
*Information Processing Letters*, 27:151–157, 1988.zbMATHMathSciNetCrossRefGoogle Scholar