Home > Term: Cook's theorem
Cook's theorem
The language SAT of satisfiable Boolean formulas is NP-complete.
- Szófaj: noun
- Ipar/Tárgykör: Computer science
- Kategória: Algorithms & data structures
- Government Agency: NIST
0
Szerzőb
- GeorgeV
-
(Gold) 1123 points - 100% positive feedback
