中文簡介

復(fù)雜的多學(xué)科雜志出版原始的研究論文，包含大量的數(shù)學(xué)結(jié)果的復(fù)雜性作為廣泛的設(shè)想。優(yōu)秀的評審論文也將發(fā)表。在計算復(fù)雜度方面，重點是實數(shù)上的復(fù)雜度，重點是下界和最優(yōu)算法。復(fù)雜性雜志也發(fā)表文章，提供主要的新算法或在上界上取得重要進展。其他計算模型，如圖靈機模型，也很有趣。計算復(fù)雜性的結(jié)果在各種各樣的領(lǐng)域被征求。領(lǐng)域包括:?近似理論?生物醫(yī)學(xué)計算?壓縮計算和傳感?計算金融?計算數(shù)論?計算推斷統(tǒng)計學(xué)?控制理論?密碼學(xué)?實驗設(shè)計?微分方程?離散問題?分布式并行計算?高維和無限大問題?信息復(fù)雜性?逆問題和不適定問題?機器學(xué)習(xí)?馬爾可夫鏈蒙特卡羅?蒙特卡羅和準蒙特卡羅?多元積分和近似?嘈雜的數(shù)據(jù)?非線性和代數(shù)方程?數(shù)值分析?算子方程?優(yōu)化?量子計算?科學(xué)計算?多元問題的可處理性?視覺和圖像理解

投稿網(wǎng)址：https://www.elsevier.com/journals/journal-of-complexity/0885-064X/guide-for-authors#17001

英文簡介

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