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

Siedlecki, Paweł; Weimar, Markus

doi:10.1016/j.jat.2015.07.007

Record: found
Abstract: not found
Article: not found

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

Author(s): Paweł Siedlecki , Markus Weimar

Publication date Created: December 2015

Publication date (Print): December 2015

Journal: Journal of Approximation Theory

Publisher: Elsevier BV

Read this article at

ScienceOpenPublisher

Bookmark

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Author and article information

Journal

Title: Journal of Approximation Theory

Abbreviated Title: Journal of Approximation Theory

Publisher: Elsevier BV

ISSN (Print): 00219045

Publication date Created: December 2015

Publication date (Print): December 2015

Volume: 200

Pages: 227-258

Article

DOI: 10.1016/j.jat.2015.07.007

SO-VID: 070e60de-83e3-4445-b230-55d22a7a0354

License:

https://www.elsevier.com/tdm/userlicense/1.0/

History

Data availability:

Comments

Comment on this article

scite_

Cited by 4

See all cited by

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