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 ... click here for full Aims & Scope
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. 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.
Research Areas Include:
•
Applied mathematics
• Numerical analysis
• Approximation theory
• Systems of algebraic equations
•
Differential equations
• Optimization
• Control theory
• Decision theory
• Design of experiments
• Distributed computation
• Vision and image understanding
• Information theory
• Prediction
and estimation
• Geophysics
• Statistics
• Economics
Hide Aims & Scope