{"paper":{"title":"Notes on $(s,t)$-weak tractability: A refined classification of problems with (sub)exponential information complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Markus Weimar, Pawe{\\l} Siedlecki","submitted_at":"2014-11-13T08:45:26Z","abstract_excerpt":"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 continuous numerical problems $S=(S_d)_{d\\in\\mathbb{N}}$ in terms of the behavior of their information complexity $n(\\epsilon,S_d)$ as a function of the accuracy $\\epsilon$ and the dimension $d$. By now a lot of effort was spend on either proving quantitative positive results (such as, e.g., the concrete dependence on $\\epsilon$ and $d$ within the well-established framework of polynomial tractability), or on qualitative"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3466","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}