default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Complexity, Volume 81
Volume 81, April 2024
- Sergei G. Solodky, Serhii A. Stasyuk:
The minimal radius of Galerkin information for the problem of numerical differentiation. 101787 - Konstantin Yu. Osipenko:
Optimal recovery and generalized Carlson inequality for weights with symmetry properties. 101807 - Ioannis K. Argyros, Santhosh George
:
On a unified convergence analysis for Newton-type methods solving generalized equations with the Aubin property. 101817 - Raymond Cheng, Rui Wang, Yuesheng Xu:
A duality approach to regularized learning problems in Banach spaces. 101818 - Liang Chen, Haixin Jiang:
On the information complexity for integration in subspaces of the Wiener algebra. 101819 - Arthur G. Werschulz:
Complexity for a class of elliptic ordinary integro-differential equations. 101820 - Stefan Heinrich:
Randomized complexity of parametric integration and the role of adaption I. Finite dimensional case. 101821 - Simon Ellinger:
Sharp lower error bounds for strong approximation of SDEs with piecewise Lipschitz continuous drift coefficient. 101822
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 2024-11-04 20:45 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:
