TR04-037 Authors: Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner

Publication: 21st April 2004 16:57

Downloads: 2801

Keywords:

Given a fixed computable binary operation f, we study the complexity of the following generation problem: The input consists of strings a1,...,an,b. The question is whether b is in the closure of {a1,...,an} under operation f.

For several subclasses of operations we prove tight upper and lower bounds for the generation problems. For example, we prove exponential-time upper and lower bounds for generation problems of length-monotonic polynomial-time computable operations. Other bounds involve classes like NP and PSPACE.

Here the class of bivariate polynomials with positive coefficients turns out to be the most interesting class of operations. We show that many of the corresponding generation problems belong to NP. However, we do not know this for all of them, e.g., for x^2+2y this is an open question. We prove NP-completeness for polynomials x^a*y^b*c where a,b,c are greater or equal 1. Also, we show NP-hardness for polynomials like x^2+2y. As a by-product we obtain NP-completeness for a generalized version of the sum of subset problem, SOS(c): Is there a subset of the input set {a1,...,an} such that the sum of its elements taken to the c-th power is equal to an inputted number b?