搜索结果: 1-2 共查到“理学 NP-hardness”相关记录2条 . 查询时间(0.109 秒)
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...
NP-hardness of decoding quantum error correction codes
NP-hardness quantum error correction codes
2010/10/18
Though the theory of quantum error correction is intimately related to the classical coding theory,in particular, one can construct quantum error correction codes (QECCs) from classical codes with the...