搜索结果

{{short description|Unsolved problem in computer science}}

…hen Cook|Cook]] and [[Leonid Levin|Levin]] proved that each easy-to-verify problem can be solved as fast as SAT, which is hence NP-complete.]] In [[computational complexity theory]], a problem is '''NP-complete''' when:

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

…|A high-level knowledge-representation framework that can be used to solve problems declaratively based on {{gli|abductive reasoning}}. It extends normal {{gl …al intelligence and computational cognitive science, "the action selection problem" is typically associated with intelligent agents and animats—artificial s

{{for|a gentler introduction|P versus NP problem}} …f problems. The left side is valid under the assumption that [[P versus NP problem|P≠NP]], while the right side is valid under the assumption that P=NP (exc

**[[Star height problem]] **[[Generalized star height problem]]

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