搜索结果

{{short description|Study of inherent difficulty of computational problems}} …her. A computational problem is a task solved by a computer. A computation problem is solvable by mechanical application of mathematical steps, such as an alg

…法可以用来证明，若'''P ≠ NP'''(一个未解决的猜想) ，对于每个正整数{{mvar|k}}，每个'''NP完全问题 NP-complete problem'''的复杂度都是 <math>\Omega(n^k)</math>。