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.

【译文】该多学科复杂性期刊发表包含广泛意义上的复杂性数学重大成果的原研究论文。还将发表杰出的综述论文。在计算复杂性领域，重点是实数上的复杂性，强调下界和最优算法。复杂性期刊还发表提供主要新算法或对上界做出重要进展的文章。其他计算模型，如图灵机模型，也很有兴趣。还征求广泛领域的计算复杂性结果。包括：近似理论、生物医学计算、压缩计算和传感、计算金融、计算数论、计算随机过程、控制理论、密码学、实验设计、微分方程、离散问题、分布式和并行计算、高维和无限维问题、信息复杂性、逆问题和病态问题、机器学习、马尔可夫链蒙特卡洛、蒙特卡洛和拟蒙特卡洛、多元积分和近似、噪声数据、非线性代数方程、数值分析、算子方程、优化、量子计算、科学计算、多变量问题的可解性、视觉和图像理解。