A New Conjecture on Hardness of 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems.Julia Chuzhoy,Mina Dalirrooyfard,Vadim Grinberg,Zihan TanITCS（2023）引用 0|浏览12暂无评分AI 理解论文溯源树样例生成溯源树，研究论文发展脉络Chat Paper正在生成论文摘要
