Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDJournal of Complexity, Volume 41
Volume 41, August 2017
- Erich Novak:
2017 Joseph F. Traub Prize for Achievement in Information-Based Complexity. v
- Guillermo Matera, Mariana Pérez
, Melina Privitelli:
On the computation of rational points of a hypersurface over a finite field. 1-34 - Van Kien Nguyen:
Gelfand numbers of embeddings of mixed Besov spaces. 35-57 - Si Tiep Dinh, Tien Son Pham:
Łojasiewicz inequalities with explicit exponents for smallest singular value functions. 58-71 - Paula Escorcielo, Daniel Perrucci:
On the Davenport-Mahler bound. 72-81 - Dennis Amelunxen, Martin Lotz:
Average-case complexity without the black swans. 82-101 - Peter Kritzer, Friedrich Pillichshammer, Henryk Wozniakowski:
L∞-Approximation in Korobov spaces with exponential weights. 102-125 - Michael Griebel, Peter Oswald:
Stable splittings of Hilbert spaces of functions of infinitely many variables. 126-151
a service of 
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 2021-09-20 22:33 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 has been originally created in 1993 at:
since 2018, dblp is operated and maintained by:
the dblp computer science bibliography is funded and supported by:
