加载中…
2022-11-06
Approximate Graph Colouring and the Crystal with a Hollow Shadow
Lorenzo CiardoStanislav Živný
文献摘要
We show that approximate graph colouring is not solved by the lift-and-project hierarchy for the combination of linear programming and linear Diophantine equations. The proof is based on combinatorial tensor theory.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本