首页 >  Term: Cook's theorem
Cook's theorem

The language SAT of satisfiable Boolean formulas is NP-complete.

0 0
Add an image
更多详细信息
0 

Featured blossaries

H9
Fantasy Football
Sports
22 Terms
13 
hotcat
CAT
Languages
0 Terms
1 
LuisAragon
Fundamentos de investigacion
Education
4 Terms
1 
Nicola Mucelli
Colori
Other
1 Terms
1 
Marouane937
The World of Moroccan Cuisine
Food
9 Terms
3 
see more blossaries

创建者
  • GeorgeV
  •  (Gold) 1123 分数
  • 100% positive feedback
© 2024 CSOFT International, Ltd.