Standard

A simplified criterion for quasi-polynomial tractability of approximation of random elements and its applications. / Хартов, Алексей Андреевич.

в: Journal of Complexity, Том 34, 2016, стр. 30-41.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Хартов, АА 2016, 'A simplified criterion for quasi-polynomial tractability of approximation of random elements and its applications', Journal of Complexity, Том. 34, стр. 30-41.

APA

Хартов, А. А. (2016). A simplified criterion for quasi-polynomial tractability of approximation of random elements and its applications. Journal of Complexity, 34, 30-41.

Vancouver

Хартов АА. A simplified criterion for quasi-polynomial tractability of approximation of random elements and its applications. Journal of Complexity. 2016;34:30-41.

Author

Хартов, Алексей Андреевич. / A simplified criterion for quasi-polynomial tractability of approximation of random elements and its applications. в: Journal of Complexity. 2016 ; Том 34. стр. 30-41.

BibTeX

@article{515ddecc177c4809abba9994253cfccc,
title = "A simplified criterion for quasi-polynomial tractability of approximation of random elements and its applications",
author = "Хартов, {Алексей Андреевич}",
year = "2016",
language = "English",
volume = "34",
pages = "30--41",
journal = "Journal of Complexity",
issn = "0885-064X",
publisher = "Elsevier",

}

RIS

TY - JOUR

T1 - A simplified criterion for quasi-polynomial tractability of approximation of random elements and its applications

AU - Хартов, Алексей Андреевич

PY - 2016

Y1 - 2016

M3 - Article

VL - 34

SP - 30

EP - 41

JO - Journal of Complexity

JF - Journal of Complexity

SN - 0885-064X

ER -

ID: 15924032