Journal of Complexity


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 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. A new area is quantum computing.

Computational complexity results in a wide variety of areas are solicited. The following is a partial list of topics: applied mathematics, numerical analysis, scientific computation, approximation theory, systems of algebraic equations, differential equations, optimization, control theory, decision theory, design of experiments, distributed computation, information theory, prediction and estimation, and statistics.

The Journal of Complexity also addresses such topics as chaos, and complexity in biological, physical, financial, and economic systems.

The Journal of Complexity gives an award for the best paper published each year. The award consists of $3000 and a certificate.

Subscription Information

The Journal of Complexity is published six times a year by Elsevier Publishing. Further information may be obtained from the Elsevier website.

Instructions for Authors

Manuscripts should be submitted in quadruplicate to any of the 27 members of the Editorial Board.
Last modified: 4:11 PM on Tue, Jan 23, 2007