Notes on $(s,t)$-weak tractability: A refined classification of problems with (sub)exponential information complexity

Paweł Siedlecki, Markus Weimar

In the last 20 years a whole hierarchy of notions of tractability was proposed and analyzed by several authors. These notions are used to classify the computational hardness of con…