default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Complexity, Volume 34
Volume 34, June 2016
- Erich Novak:
Thomas Müller-Gronbach, Klaus Ritter and Larisa Yaroslavtseva share the 2015 Best Paper Award. v - Erich Novak:
Nominations for 2016 Information-Based Complexity Young Researcher Award. vii
- Bernd Bank, Joos Heintz, Guillermo Matera
, José Luis Montaña, Luis M. Pardo, Andres Rojas Paredes:
Quiz games as a model for information hiding. 1-29 - Alexey A. Khartov:
A simplified criterion for quasi-polynomial tractability of approximation of random elements and its applications. 30-41 - Yongping Liu, Guiqiao Xu:
A note on tractability of multivariate analytic problems. 42-49 - Malgorzata Moczurad, Piotr Zgliczynski, Wlodzimierz Zwonek:
New lower bound estimates for quadratures of bounded analytic functions. 50-67 - Aicke Hinrichs, Gerhard Larcher:
An improved lower bound for the L2-discrepancy. 68-77 - Esmaeil Mehrabi, Éric Schost:
A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers. 78-128 - Rui Wang, Haizhang Zhang:
Optimal sampling points in reproducing kernel Hilbert spaces. 129-151
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-07-08 20:48 CEST 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:
