Revision as of 15:52, 17 January 2024 edit 128.197.29.248 (talk) →Run-tine complexity ← Previous edit		Revision as of 18:31, 17 January 2024 edit undo S.J. van Dokkum (talk \| contribs) 1 edit m →Run-time complexity: snd -> and Tags: Mobile edit Mobile app edit Android app edit Next edit →
Line 217: * In the [[Turing machine]] model, SDF is in NP iff it is in co-NP. Therefore, SDF is not NP-complete unless NP=coNP. * In the [[Blum–Shub–Smale machine]] model, SDF is in the intersection of NP ~~snd~~and co-NP. == Approximation algorithms ==

Semidefinite programming: Difference between revisions