搜索结果: 1-4 共查到“NP-hardness”相关记录4条 . 查询时间(0.071 秒)
The possibility of basing cryptography on the minimal assumption NP⊈BPPNP⊈BPP is at the very heart of textbflexity-theoretic cryptography. The closest we have gotten so far is lattice-base...
On Basing Private Information Retrieval on NP-Hardness
Private Information Retrieval NP-hardness Reductions
2015/12/21
The possibility of basing the security of cryptographic objects on the (minimal) assumption
that NP ⊈ BPP is at the very heart of complexity-theoretic cryptography. Most known results
along th...
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...