Unverified50% confidenceFactExact time
The computational complexity of DFT typically scales as the cube of the number of atoms N (O(N³)).
1
Sources
50%
Confidence
Long-term
Relevance
8/14/2026
First Seen
Sources
Related Claims
Unverified量子蒙特卡洛（QMC）和耦合簇理论（CCSD(T)）的计算量分别随系统规模呈O(N³)至O(N⁷)增长66% similarUnverified耦合簇理论CCSD(T)被称为量子化学的黄金标准，计算量随系统规模呈O(N³)至O(N⁷)增长59% similarUnverifiedIn 1984, Spencer, Szemerédi, and Trotter proved the upper bound result U(N) ≤ O(N^(4/3)), meaning the number of unit-distance pairs among N points does not exceed a constant multiple of N to the power of 4/3.58% similarUnverified匈牙利算法于1955年提出，以O(n³)时间复杂度解决二分图最优匹配问题58% similarUnverified经典计算机模拟N个电子的量子系统所需内存和计算量随N呈2^N指数增长57% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/749299API
curl https://kongchang.com/api/v1/knowledge/claims/749299MCP
get_claim(id=749299)