Uniform weak tractability

• Authors: Paweł Siedlecki
• Venue: Journal of Complexity
• Year: 2013

We introduce a new notion of tractability which is called uniform weak tractability. A problem is uniformly weakly tractable if the information complexity n(@e,d) of its d-variate component to be solved to within @e is not exponential in any positive power of @e^-^1 and/or d. This notion is stronger than weak tractability which requires that n(@e,d) is not exponential only in @e^-^1 and d, and weaker than quasi-polynomial tractability which requires that lnn(@e,d) is of order (1+ln@e^-^1)(1+lnd). For the class @L^a^l^l of all linear functionals, we derive necessary and sufficient conditions for a linear tensor product problem to be uniformly weakly tractable. For the class @L^s^t^d of function values, we relate the uniform weak tractability of approximation problems to already known results for weak tractability. We study uniform weak tractability in the worst case, average case and randomized settings. We present problems which are uniformly weakly tractable, but not quasi-polynomially tractable. There are also problems that are weakly tractable, but not uniformly weakly tractable. This shows that the notion of uniform weak tractability does not, in general, coincide with the notions of weak or quasi-polynomial tractability.