A working definition of NP-hard (Stephen Boyd, Stanford)

A working definition of NP-hard (Stephen Boyd, Stanford)

begin-post-stats

hamsterpoop • 32K views

end-post-stats begin-duration 5:23 end-duration
Math topics:
_Numbers_##Numbers##_Binary_number_##Binary number##_Cardinality_##Cardinality##_Number_##Number
Other topics:
_Complexity_classes_##Complexity classes##_NP_(complexity)_##NP (complexity)##_P_(complexity)_##P (complexity)##_NP-hardness_##NP-hardness##_Semantics_##Semantics##_Conjecture_##Conjecture##_Tautology_(logic)_##Tautology (logic)##_Definition_##Definition##_Meaning_(linguistics)_##Meaning (linguistics)##_Computer_science_##Computer science##_Time_complexity_##Time complexity##_Computer_science_##Computer science##_Algorithm_##Algorithm
video-id: 7hRLOnTn7o4 channel_hamsterpoop_
So What Learning
Complexity classes , Computer science , Numbers , Semantics
Monday, January 22, 2018