Journal of Complexity

Papers
(The TQCC of Journal of Complexity is 3. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-04-01 to 2025-04-01.)
ArticleCitations
On the complexity of Putinar–Vasilescu's Positivstellensatz29
Space-filling designs on Riemannian manifolds28
Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations26
Convergence analysis of iteratively regularized Landweber iteration with uniformly convex constraints in Banach spaces26
Bounds for discrepancies in the Hamming space23
Influence of numerical discretizations on hitting probabilities for linear stochastic parabolic systems17
On the power of standard information for tractability for L2-approximation in the average case setting16
On the complexity of convergence for high order iterative methods15
Optimal subsampling for least absolute relative error estimators with massive data15
A continuous characterization of PSPACE using polynomial ordinary differential equations14
Kolmogorov widths of intersections of finite-dimensional balls12
Nonlinear Tikhonov regularization in Hilbert scales for inverse learning11
Radius of information for two intersected centered hyperellipsoids and implications in optimal recovery from inaccurate data10
On the approximation of vector-valued functions by volume sampling10
Lower bounds for artificial neural network approximations: A proof that shallow neural networks fail to overcome the curse of dimensionality10
Enhancing the applicability of Chebyshev-like method10
High probability bounds on AdaGrad for constrained weakly convex optimization9
On the complexity of fitted toral dynamics8
Editorial Board8
Discrepancy bounds for normal numbers generated by necklaces in arbitrary base8
Central Limit Theorem for the volume of the zero set of Kostlan-Shub-Smale random polynomial systems8
Heuristic approaches to obtain low-discrepancy point sets via subset selection8
Editorial Board7
Nominations for 2023 Joseph F. Traub Information-Based Complexity Young Researcher Award6
Editorial Board6
Editorial Board6
Best Paper Award of the Journal of Complexity6
Optimal recovery and generalized Carlson inequality for weights with symmetry properties6
Changes of the Editorial Board6
Changes of the Editorial Board6
On negative dependence properties of Latin hypercube samples and scrambled nets6
On the cardinality of lower sets and universal discretization5
Sampling numbers of smoothness classes via ℓ1-minimization5
Nominations for 2022 Joseph F. Traub Information-Based Complexity Young Researcher Award5
Approximating smooth and sparse functions by deep neural networks: Optimal approximation rates and saturation4
Optimal pointwise sampling for L2 approximation4
Weaker convergence criteria for Traub's method4
Editorial Board4
High-order lifting for polynomial Sylvester matrices4
Randomized complexity of parametric integration and the role of adaption I. Finite dimensional case4
On the complexity of a unified convergence analysis for iterative methods4
Matrix and tensor rigidity and L-approximation4
Central Limit Theorem for (t,s)-sequences in base 24
Editorial Board3
Lower bounds for integration and recovery in L23
A quasi-Monte Carlo data compression algorithm for machine learning3
Convergence of the Gauss-Newton method for convex composite optimization problems under majorant condition on Riemannian manifolds3
A generative model for fBm with deep ReLU neural networks3
Editorial Board3
On a partition with a lower expected L23
The VC-dimension of axis-parallel boxes on the Torus3
Approximation by quasi-interpolation operators and Smolyak's algorithm3
Function values are enough for L2-approximation: Part II3
Worst case tractability of linear problems in the presence of noise: Linear information3
Optimal recovery and volume estimates3
On a central algorithm for calculation of the inverse of the harmonic oscillator in the spaces of orbits3
Editorial Board3
On the relation of the spectral test to isotropic discrepancy and L-approximation in Sobolev spaces3
Noisy polynomial interpolation modulo prime powers3
On the power of standard information for tractability for L∞ approximation of periodic functions in the worst case setting3
A unified treatment of tractability for approximation problems defined on Hilbert spaces3
Tractability for Volterra problems of the second kind with convolution kernels3
Editorial Board3
Convergence rates of support vector machines regression for functional data3
0.048876047134399