11 citations to 10.1016/j.jco.2007.11.002 (Crossref Cited-By Service)
  1. A.A. Khartov, M. Zani, “Approximation complexity of sums of random processes”, Journal of Complexity, 54, 2019, 101399  crossref
  2. A.A. Khartov, “Asymptotic analysis of average case approximation complexity of Hilbert space valued random elements”, Journal of Complexity, 31, № 6, 2015, 835  crossref
  3. Konrad Abramowicz, Oleg Seleznjev, “Piecewise-Multilinear Interpolation of a Random Field”, Advances in Applied Probability, 45, № 4, 2013, 945  crossref
  4. Mikhail Lifshits, Marguerite Zani, “Approximation of additive random fields based on standard information: Average case and probabilistic settings”, Journal of Complexity, 31, № 5, 2015, 659  crossref
  5. M. Zani, A. A. Khartov, “Decomposition of Additive Random Fields”, Vestnik St.Petersb. Univ.Math., 53, № 1, 2020, 29  crossref
  6. M.A. Lifshits, A. Papageorgiou, H. Woźniakowski, “Average case tractability of non-homogeneous tensor product problems”, Journal of Complexity, 28, № 5-6, 2012, 539  crossref
  7. Henryk Woźniakowski, “ABC on IBC”, Journal of Complexity, 52, 2019, 2  crossref
  8. A.A. Khartov, M. Zani, “Asymptotic analysis of average case approximation complexity of additive random fields”, Journal of Complexity, 52, 2019, 24  crossref
  9. Abdollah Arasteh, Seyyed Gholamreza Jalali Naini, Alireza Aliahmadi, “Considering the game-theoretic approach and ultra combinative costs on scheduling”, Int J Adv Manuf Technol, 70, № 5-8, 2014, 1473  crossref
  10. A.A. Khartov, “A simplified criterion for quasi-polynomial tractability of approximation of random elements and its applications”, Journal of Complexity, 34, 2016, 30  crossref
1
2
Следующая