default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Complexity, Volume 39
Volume 39, April 2017
- Erich Novak:
Mario Hefter Wins the 2016 Joseph F. Traub Information-Based Complexity Young Researcher Award. v - Erich Novak:
2017 Joseph F. Traub Information-Based Complexity Young Researcher Award: Nomination deadline: Sept. 30 2017. vi
- Yoel Drori:
The exact information-based complexity of smooth convex minimization. 1-16 - James M. Calvin
, Mario Hefter, André Herzwurm:
Adaptive approximation of the minimum of Brownian motion. 17-37 - Ignacio García-Marco, Pascal Koiran:
Lower bounds by Birkhoff interpolation. 38-50 - Kosuke Suzuki:
Super-polynomial convergence and tractability of multivariate integration for infinitely times differentiable functions. 51-68 - Malgorzata Moczurad, Piotr Zgliczynski:
On the Petras algorithm for verified integration of piecewise analytic functions. 69-93 - Jia Chen, Heping Wang:
Preasymptotics and asymptotics of approximation numbers of anisotropic Sobolev embeddings. 94-110 - Haralambos Evangelaras, Markos V. Koutras:
On second order orthogonal Latin hypercube designs. 111-121
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-25 23:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
