Abstract

Given a fixed computable binary operation f, we study the complexity of the following generation problem: the input consists of strings a₁,…,a_n,b. The question is whether b is in the closure of {a₁,…,a_n} 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²+2y this is an open question. We prove NP-completeness for polynomials x^ay^bc where a,b,c1. Also, we show NP-hardness for polynomials like x²+2y. As a by-product we obtain NP-completeness of the extended sum-of-subset problem for any c1.

Keywords: Computational complexity; Closures; Polynomials; SOS problem