Home > Term: Cook's theorem
Cook's theorem
The language SAT of satisfiable Boolean formulas is NP-complete.
- Besedna vrsta: noun
- Industrija/področje: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
Avtor
- GeorgeV
-
(Gold) 1123 points - 100% positive feedback
