Prove optimization of nonconvex function is NP-hard
2 years ago
3
Prove optimization of nonconvex function is NP-hard
I prove optimization of nonconvex function is NP-hard by reducing the problem into subset sum
Donate to Channel(斗內一下): https://paypal.me/kuoenjui
Facebook: https://www.facebook.com/mathenjui
Instagram: https://www.instagram.com/mathphyen/
Subscribe to my channel
Loading comments...
-
22:28
ericntunctu
2 years agoAnalytic number theory : prove Dirichlet theorem 2 reduction to L function
4 -
12:03
tomerbd
2 years agoOptimization
2 -
59:22
The Dan Bongino Show
7 hours agoBe Prepared For The Worst If The Dems Lose (Ep. 2313) - 08/21/2024
722K1.68K -
1:50:50
Benny Johnson
6 hours ago🚨Obama's Hood For TRUMP! Don Jr. LIVE From The DNC as Michelle, Barack BACKSTAB Biden | Kamala GONE
132K157 -
2:11:32
Matt Kohrs
16 hours agoKamala's Plan To DESTROY The Economy & Stock Market || The MK Show
101K23 -
11:54
Dr. Eric Berg
7 hours agoThese Mistakes Are Super Unhealthy!
73.5K15 -
6:12:11
PudgeTV
2 days ago🟠 ELDEN RING on Rumble | Mourning Death Count Continues
76.8K3 -
16:01
731woodworks
6 hours agoI Found an INCREDIBLE Woodworking Tool for SMALL SHOPS!
60K3 -
13:54
JoBlo Horror Originals
1 day agoWhat Happened To Summer Of Sam?
54.3K2 -
1:32:37
Graham Allen
9 hours agoObamas Prove They Are Running The Country As Kamala Is Absent From DNC!!! EVIL IS COMING!!!
102K343