default search action
Journal of Complexity, Volume 68
Volume 68, February 2022
- Luis M. Pardo, Daniel Sebastián:
A promenade through correct test sequences I: Degree of constructible sets, Bézout's Inequality and density. 101588 - Yoel Drori, Adrien B. Taylor:
On the oracle complexity of smooth strongly convex minimization. 101590 - Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint:
Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives. 101591 - Duglas Ugulava, David Zarnadze:
On a central algorithm for calculation of the inverse of the harmonic oscillator in the spaces of orbits. 101599 - Pierre Gillibert, Thomas Lachmann, Clemens Müllner:
The VC-dimension of axis-parallel boxes on the Torus. 101600 - Matthieu Dolbeault, Albert Cohen:
Optimal pointwise sampling for L2 approximation. 101602 - Josef Dick, Aicke Hinrichs, Erich Novak, Klaus Ritter, Grzegorz W. Wasilkowski, Henryk Wozniakowski:
Changes of the Editorial Board. 101623 - Erich Novak:
Michaela Szölgyenyi is the winner of the 2021 Joseph F. Traub Information-Based Complexity Young Researcher Award. 101624 - Erich Novak:
Nominations for 2022 Joseph F. Traub Information-Based Complexity Young Researcher Award. 101625
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.