default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Complexity, Volume 67
Volume 67, December 2021
- Adrian Ebert, Friedrich Pillichshammer:
Tractability of approximation in the weighted Korobov space in the worst-case setting - a complete picture. 101571 - Vincent Neiger
, Clément Pernet:
Deterministic computation of the characteristic polynomial in the time of matrix multiplication. 101572 - Jie Zhang:
A note on EC-tractability of multivariate approximation in weighted Korobov spaces for the standard information class. 101573 - Joris van der Hoeven, Grégoire Lecerf:
Fast amortized multi-point evaluation. 101574 - Vladimir N. Temlyakov, Tino Ullrich:
Bounds on Kolmogorov widths and sampling recovery for classes with small mixed smoothness. 101575 - Mathias Sonnleitner, Friedrich Pillichshammer:
On the relation of the spectral test to isotropic discrepancy and Lq-approximation in Sobolev spaces. 101576 - Josef Dick, Michael Feischl:
A quasi-Monte Carlo data compression algorithm for machine learning. 101587 - Benjamin Doerr, Michael Gnewuch:
On negative dependence properties of Latin hypercube samples and scrambled nets. 101589
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-10-02 20:44 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:
