Please use this identifier to cite or link to this item:
|Title:||A simplified criterion for quasi-polynomial tractability of approximation of random elements and its applications|
|Authors:||Khartov, Alexey Andreevich|
|Series/Report no.:||Journal of Complexity;34|
|Description:||Conferences: International Workshop "Information-Based Complexity and Model Selection", France, Paris, (April 9 - 10, 2015); International Conference "Information-based complexity", Poland, Bedlewo (April 26 - May 2, 2015);|
|Appears in Collections:||Articles|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.