The multidisciplinary 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. The 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.

《Journal Of Complexity》是一本由ACADEMIC PRESS INC ELSEVIER SCIENCE出版商出版的专业数学期刊，该刊创刊于1985年，刊期Quarterly，该刊已被国际权威数据库SCI、SCIE收录。在中科院最新升级版分区表中，该刊分区信息为大类学科：数学 2区，小类学科：应用数学 1区；数学 2区；在JCR（Journal Citation Reports）分区等级为Q2。该刊发文范围涵盖数学等领域，旨在及时、准确、全面地报道国内外数学工作者在该领域取得的最新研究成果、工作进展及学术动态、技术革新等，促进学术交流，鼓励学术创新。2021年影响因子为1.333，平均审稿速度>12周，或约稿。