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 ...

For all of the recent strides we’ve made in the math world—like a supercomputer finally solving the Sum of Three Cubes problem that puzzled mathematicians for 65 years—we’re forever crunching ...

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 ...