2015/04/02 by Peng Cui, Cui, Peng
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Computational Geometry and Mesh Generation #F.1.3 #F.2.2 #FOS: Computer and information sciences #cs.CC
paper · pdf · doi:10.48550/arxiv.1504.00442
6 pages, short note. arXiv admin note: substantial text overlap with arXiv:1401.6520
openalex publication_date 2015/04/02 · arxiv created 2015/11/09 · arxiv updated 2015/11/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this short note, the author shows that the gap problem of some k-CSPs with the support of its predicate the ground of a balanced pairwise independent distribution can be solved by a modified version of Hast's Algorithm BiLin that calls Charikar&Wirth's SDP algorithm for two rounds in polynomial time, when k is sufficiently large, the support of its predicate is combined by the grounds of three biased homogeneous distributions and the three biases satisfy certain conditions. To conclude, the author refutes Unique Game Conjecture, assuming P≠ NP.