A Nonapproximability Result for Finite Function Generation

Abstract We show that an optimization problem in connection with Finite Function Generation is PSPACE-hard to approximate within an exponential lower bound.

[1]  J. Rosser,et al.  Approximate formulas for some functions of prime numbers , 1962 .

[2]  M. Hall.  The Theory Of Groups , 1959 .

[3]  Dexter Kozen,et al.  Lower bounds for natural proof systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[4]  Joan Feigenbaum,et al.  Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions , 1995, Chic. J. Theor. Comput. Sci..

[5]  Harry B. Hunt,et al.  Generalized CNF satisfiability problems and non-efficient approximability , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.