Please use this identifier to cite or link to this item: http://hdl.handle.net/11701/2305
Title: A simplified criterion for quasi-polynomial tractability of approximation of random elements and its applications
Authors: Khartov, Alexey Andreevich
Issue Date: Jun-2016
Publisher: Elsevier
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);
URI: http://hdl.handle.net/11701/2305
ISSN: 0885064X
Appears in Collections:Articles

Files in This Item:
File Description SizeFormat 
Manuscript.pdfManuscript302,93 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.