Journal of Complexity

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

This journal has an Open Archive. All published items, including research articles, have unrestricted access and will remain permanently free to read and download 48 months after publication. All papers in the Archive are subject to Elsevier's user license.