Algebra and the Complexity of Digraph CSPs: a Survey.
The Constraint Satisfaction Problem（2017）
摘要
We present a brief survey of some of the key results on the interplay between algebraic and graph-theoretic methods in the study of the complexity of digraph-based constraint satisfaction problems.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要