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 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