default search action
Journal of Complexity, Volume 30
Volume 30, Number 1, February 2014
- Erich Novak, Ian H. Sloan
, Joseph F. Traub, Henryk Wozniakowski:
Christoph Aistleitner Wins the 2013 Information-Based Complexity Young Researcher Award. v
- Mark A. Iwen:
Compressed sensing with sparse binary matrices: Instance optimal error guarantees in near-optimal time. 1-15 - Benjamin Doerr:
A lower bound for the discrepancy of a random point set. 16-20 - Nicholas Clancy, Yuhan Ding, Caleb Hamilton, Fred J. Hickernell
The cost of deterministic, adaptive, automatic algorithms: Cones, not balls. 21-45 - Gang Xu, Jian Zhang, Yu Tang:
Level permutation method for constructing uniform designs under the wrap-around L2-discrepancy. 46-53 - Guiqiao Xu:
Quasi-polynomial tractability of linear problems in the average case setting. 54-68 - Hans Triebel:
Weighted discrepancy and numerical integration in function spaces. 69-86 - Markus Weimar
On lower bounds for integration of multivariate permutation-invariant functions. 87-97 - Bochuan Jiang
Construction of uniform designs without replications. 98-110
Volume 30, Number 2, April 2014
- Aicke Hinrichs, Andreas Neuenkirch
Guest Editors' Preface. 1
- Josef Dick
Approximation of analytic functions in Korobov spaces. 2-28 - Michael Gnewuch, Sebastian Mayer
On weighted Hilbert spaces and integration of functions of infinitely many variables. 29-47 - Jan Vybíral
Weak and quasi-polynomial tractability of approximation of infinitely differentiable functions. 48-55 - Reinhold Schneider, André Uschmajew:
Approximation rates for the hierarchical tensor format in periodic Sobolev spaces. 56-71 - Tino Ullrich
Optimal cubature in Besov spaces with dominating mixed smoothness on the unit square. 72-94 - Thomas Kühn
Approximation numbers of Sobolev embeddings - Sharp constants and tractability. 95-116 - Aicke Hinrichs, Erich Novak, Mario Ullrich
The curse of dimensionality for numerical integration of smooth functions II. 117-143
Volume 30, Number 3, June 2014
- Erich Novak, Ian H. Sloan
Shu Tezuka, Joos Heintz, Bart Kuijpers, and Andrés Rojas Paredes Share the 2013 Best Paper Award. v
- Adam W. Kolkiewicz:
Efficient Monte Carlo simulation for integral functionals of Brownian motion. 255-278 - Domingo Gómez-Pérez
On the Carlitz rank of permutations of Fq and pseudorandom sequences. 279-289 - Shuai Lu, Peter Mathé
Discrepancy based model selection in statistical inverse problems. 290-308 - José Antonio Ezquerro
A semilocal convergence result for Newton's method under generalized conditions of Kantorovich. 309-324 - Grzegorz W. Wasilkowski:
Tractability of approximation of ∞-variate functions with bounded mixed partial derivatives. 325-346 - Kosuke Suzuki
An explicit construction of point sets with large minimum Dick weight. 347-354 - Hengzhen Huang, Jian-Feng Yang, Min-Qian Liu
Construction of sliced (nearly) orthogonal Latin hypercube designs. 355-365 - Petko D. Proinov
A new semilocal convergence theorem for the Weierstrass method for finding zeros of a polynomial simultaneously. 366-380
Volume 30, Number 4, August 2014
- Erich Novak, Ian H. Sloan
Frances Kuo Wins the 2014 Information-Based Complexity Prize. v - Nominations for 2015 Prize for Achievement in Information-Based Complexity. vi
- Christoph Aistleitner:
Tractability results for the weighted star-discrepancy. 381-391 - Thomas Daun, Stefan Heinrich:
Complexity of parametric initial value problems in Banach spaces. 392-429 - Bernd Bank, Marc Giusti, Joos Heintz, Mohab Safey El Din:
Intrinsic complexity estimates in polynomial optimization. 430-443 - James A. Nichols
Fast CBC construction of randomly shifted lattice rules achieving O(n-1+δ) convergence for unbounded integrands over R5 in weighted spaces with POD weights. 444-468 - Anargyros Papageorgiou, Iasonas Petras:
Estimating the ground state energy of the Schrödinger equation for convex potentials. 469-494 - Shun Zhang, Alicja Dota
s-numbers of compact embeddings of function spaces on quasi-bounded domains. 495-513 - Shun Zhang, Gensun Fang, Fanglun Huang:
Some s-numbers of embeddings in function spaces with polynomial weights. 514-532 - Ángel Alberto Magreñán Ruiz
Two-step Newton methods. 533-553
Volume 30, Number 5, October 2014
- Erich Novak, Ian H. Sloan, Joseph F. Traub, Henryk Wozniakowski:
Announcement. v
- Bernd Carl, Aicke Hinrichs, Philipp Rudolph:
Entropy numbers of convex hulls in Banach spaces and applications. 555-587 - Lisi D'Alfonso, Gabriela Jeronimo, Pablo Solernó:
Effective differential Nullstellensatz for ordinary DAE systems with constant coefficients. 588-603 - Anargyros Papageorgiou, Iasonas Petras:
A new criterion for tractability of multivariate problems. 604-619 - Henri Faure, Christiane Lemieux:
A variant of Atanassov's method for (t, s)-sequences and (t, e, s)-sequences. 620-633 - Turlough Neary
Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy. 634-646 - Hugo Férée
Analytical properties of resource-bounded real functionals. 647-671
Volume 30, Number 6, December 2014
- Negar Soheili, Javier Peña:
A condition-based algorithm for solving polyhedral feasibility problems. 673-682 - Yanzhao Cao, Ying Jiang, Yuesheng Xu:
Orthogonal polynomial expansions on sparse grids. 683-715 - Pawel Siedlecki
Uniform weak tractability of multivariate problems with increasing smoothness. 716-734 - Guiqiao Xu:
Tractability of linear problems defined over Hilbert spaces. 735-749 - Thomas Daun, Stefan Heinrich:
Complexity of parametric integration in various smoothness classes. 750-766
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-01-18 00:51 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: