Years ago, an audacious Fields medalist outlined a sweeping program that, he claimed, could be used to resolve a major ...
A diagram showing the relevant complexity classes in the P vs NP problem. “P” problems are solvable in polynomial time; “NP” problems might be solvable in polynomial time, and are checkable in ...
In this paper, we establish hardness and approximation results for various Lp-ball constrained homogeneous polynomial optimization problems, where p ∈ [2, ∞]. Specifically, we prove that for any given ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback