THE PRICING PROBLEM. PART 2. THE COMPUTATIONAL COMPLEXITY
For the problem, it is shown that it belongs to the class Log-APX, cannot be approximable with an absolute error limited by a constant, and the corresponding evaluation problem is non-trivial in the class Δ <sup>p</sup> <sub>2</sub>. Also, two polynomial solvable cases of the problem are provided.