搜索结果: 1-1 共查到“理学 NP-hardness of Deciding Convexity of Quartic Polynomials”相关记录1条 . 查询时间(0.046 秒)
NP-hardness of Deciding Convexity of Quartic Polynomials and Related Problems
NP-hardness of Deciding Convexity of Quartic Polynomials Related Problems
2011/1/19
We show that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time)
algorithm that can decide whether a multivariate polynomial of degree four (or higher even
degree) is globa...