Journal of Complexity

Papers
(The TQCC of Journal of Complexity is 4. 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 2022-05-01 to 2026-05-01.)
ArticleCitations
Central Limit Theorem for the volume of the zero set of Kostlan-Shub-Smale random polynomial systems43
Rademacher learning rates for iterated random functions36
On the approximation of vector-valued functions by volume sampling29
Multilevel Picard approximations overcome the curse of dimensionality in the numerical approximation of general semilinear PDEs with gradient-dependent nonlinearities26
A continuous characterization of PSPACE using polynomial ordinary differential equations21
Optimal recovery and volume estimates20
Central Limit Theorem for (t,s)-sequences in base 219
Optimal approximation of infinite-dimensional holomorphic functions II: Recovery from i.i.d. pointwise samples14
Generalization bounds of adversarial bipartite ranking with pairwise perturbation12
Random-prime–fixed-vector randomised lattice-based algorithm for high-dimensional integration12
Changes of the Editorial Board10
Kateryna Pozharska is the winner of the 2023 Joseph F. Traub Information-Based Complexity Young Researcher Award9
Approximation in periodic Gevrey spaces9
On the strong convergence rate for the Euler–Maruyama scheme of one-dimensional SDEs with irregular diffusion coefficient and local time8
A duality approach to regularized learning problems in Banach spaces8
A simplified iteratively regularized projection method for nonlinear ill-posed problems8
Tractability of L2-approximation and integration in weighted Hermite spaces of finite smoothness8
Editorial Board8
On regularized polynomial functional regression8
On the complexity of strong approximation of stochastic differential equations with a non-Lipschitz drift coefficient7
Direct estimates for adaptive time-stepping finite element methods7
Improved bounds for the bracketing number of orthants or revisiting an algorithm of Thiémard to compute bounds for the star discrepancy7
On the expected number of real roots of polynomials and exponential sums7
Approximate equality for two sums of roots7
Online regularized learning algorithm for functional data7
Editorial Board7
On the complexity of orbit word problems7
Computing zeta functions of large polynomial systems over finite fields6
Editorial Board6
On optimal recovery and information complexity in numerical differentiation and summation6
An unfeasibility view of neural network learning6
Skewness of a randomized quasi-Monte Carlo estimate6
Editorial Board6
On the computation of rational solutions of underdetermined systems over a finite field6
Online outcome weighted learning with general loss functions6
On the complexity of a unified convergence analysis for iterative methods5
Lower bounds for artificial neural network approximations: A proof that shallow neural networks fail to overcome the curse of dimensionality5
On the cardinality of lower sets and universal discretization5
Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations5
Optimal recovery and generalized Carlson inequality for weights with symmetry properties5
On the power of standard information for tractability for L2-approximation in the average case setting5
Lower bounds for integration and recovery in L24
Takashi Goda is the winner of the 2025 Joseph F. Traub Prize for Achievement in Information-Based Complexity4
Weighted sampling recovery of functions with mixed smoothness4
Optimal recovery of linear operators from information of random functions4
Editorial Board4
Geo-indistinguishable location obfuscation with inference error bounds4
Best Paper Award of the Journal of Complexity4
Accelerated convergence of error quantiles using robust randomized quasi Monte Carlo methods4
Numerical weighted integration of functions having mixed smoothness4
The area of empty axis-parallel boxes amidst 2-dimensional lattice points4
Countable tensor products of Hermite spaces and spaces of Gaussian kernels4
Editorial Board4
Editorial Board4
Statistical analysis of prediction in functional polynomial quantile regression4
Complexity for a class of elliptic ordinary integro-differential equations4
On oracle factoring of integers4
0.1537389755249