Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory

Rice's Theorem says that every nontrivia semantic property of programs is undecidable. In this spirit we show the following: Every nontrivia absolute (gap, relative) counting property of circuits is UP-hard with respect to polynomial-time Turing reductions. For generators [31] we show a perfect analogue of Rice's Theorem.

[1]  Leslie G. Valiant,et al.  Relative Complexity of Checking and Evaluating , 1976, Inf. Process. Lett..

[2]  Jörg Rothe,et al.  A Second Step Towards Circuit Complexity-Theoretic Analogs of Rice's Theorem , 1998, MFCS.

[3]  H. Gordon Rice,et al.  On completely recursively enumerable classes and their key arrays , 1956, Journal of Symbolic Logic.

[4]  Gerd Wechsung,et al.  A survey on counting classes , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[5]  Antoni Lozano,et al.  Succinct Circuit Representations and Leaf Language Classes are Basically the Same Concept , 1996, Inf. Process. Lett..

[6]  Juris Hartmanis,et al.  Complexity Classes without Machines: On Complete Languages for UP , 1988, Theor. Comput. Sci..

[7]  Chee-Keng Yap,et al.  Some Consequences of Non-Uniform Conditions on Uniform Classes , 1983, Theor. Comput. Sci..

[8]  Alan L. Selman,et al.  Complexity Measures for Public-Key Cryptosystems , 1988, SIAM J. Comput..

[9]  Andreas Blass,et al.  On the Unique Satisfiability Problem , 1982, Inf. Control..

[10]  Stuart A. Kurtz,et al.  Gap-Definable Counting Classes , 1994, J. Comput. Syst. Sci..

[11]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[12]  Desh Ranjan,et al.  On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions , 1998, Theory of Computing Systems.

[13]  Richard Beigel.  A structural theorem that depends quantitatively on the complexity of SAT , 1987, Computational Complexity Conference.

[14]  Sanjay Gupta.  The power of witness reduction , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[15]  Frank Stephan,et al.  Approximable Sets , 1995, Inf. Comput..

[16]  Manindra Agrawal,et al.  The Boolean isomorphism problem , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[17]  Dexter Kozen,et al.  Indexings of Subrecursive Classes , 1980, Theor. Comput. Sci..

[18]  Helmut Veith.  Succinct Representation, Leaf Languages, and Projection Reductions , 1998, Inf. Comput..

[19]  Uwe Schöning.  On Small Generators , 1984, Theor. Comput. Sci..

[20]  Gilles Brassard,et al.  The quantum challenge to structural complexity theory , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[21]  H. Rice.  Classes of recursively enumerable sets and their decision problems , 1953 .

[22]  R. Ladner.  The circuit value problem is log space complete for P , 1975, SIGA.

[23]  Leslie G. Valiant,et al.  NP is as easy as detecting unique solutions , 1985, STOC '85.