The multidisciplinarym Journal of Complexity publishes original research papers that contain substantial mathematical results on complexity as broadly conceived. Outstanding review papers will also be published. In the area of computational complexity, the focus is on complexity over the reals, with the emphasis on lower bounds and optimal algorithms.

Journal of Complexity also publishes articles that provide major new algorithms or make important progress on upper bounds. Other models of computation, such as the Turing machine model, are also of interest. Computational complexity results in a wide variety of areas are solicited.

Areas Include:

Approximation theory
Biomedical computing
Compressed computing and sensing
Computational finance
Computational number theory
Computational stochastics
Control theory
Cryptography
Design of experiments
Differential equations
Discrete problems
Distributed and parallel computation
High and infinite-dimensional problems
Information-based complexity
Inverse and ill-posed problems
Machine learning
Markov chain Monte Carlo
Monte Carlo and quasi-Monte Carlo
Multivariate integration and approximation
Noisy data
Nonlinear and algebraic equations
Numerical analysis
Operator equations
Optimization
Quantum computing
Scientific computation
Tractability of multivariate problems
Vision and image understanding

Special Issue on Festschrift for Henryk Woźniakowski (on the occasion of his 80th birthday)
截稿日期: 2026-07-31

This special issue will celebrate both Henryk Woźniakowski’s 80th birthday and the enduring significance of information-based complexity as a central theme of the Journal of Complexity.

Guest editors:

Josef Dick (UNSW Sydney, Australia)Michael Gnewuch (University of Osnabrück, Germany)
Erich Novak (Friedrich Schiller University Jena, Germany)
Leszek Plaskota (University of Warsaw, Poland)
Jan Vybíral (Czech Technical University in Prague, Czech Republic)

Manuscript submission information:

The proposed special issue will focus on themes that reflect the breadth and depth of Henryk Woźniakowski's research and its continuing influence. Typical topics include(but are not limited to):

Tractability and strong tractability of linear and nonlinear multivariate problems

(s, t)-weak tractability and related notions​
Information-based complexity in worst-case, average-case, and randomized settings
Explicit cost bounds and tensor product problems​
Quasi-Monte Carlo methods and discrepancy theory
High-dimensional integration, approximation, and optimization
Weighted function spaces and reproducing kernel Hilbert spaces
Gaussian measures and analytic function approximation
Probabilistic and quantum models in complexity analysis
Applications to uncertainty quantification, machine learning, and PDEs
Historical and conceptual developments in information-based complexity

This scope closely aligns with the established aims and readership of the Journal of Complexity.

Manuscripts should be submitted online through the following link: Submission Page
Authors must select VSI:YJCOM_Festschrift Woźniakowski when they reach the “Article Type” step in the online submission process.

All submissions will undergo the standard peer-review procedure of the Journal of Complexity. The guest editors will coordinate the review process in close cooperation with the Editor-in-Chief. A tentative schedule is as follows:

Submission deadline July 31, 2026

Each paper will be published online as soon as it has successfully passed the review process, following the regular publication workflow of Elsevier.