加载中…
2025-01-11
Col is PSPACE-complete on Triangular Grids
Kyle BurkeCraig Tennenhouse
文献摘要
We demonstrate that Col is PSPACE-complete on triangular grid graphs via a reduction from Bounded Two-Player Constraint Logic. This is the most structured graph family that Col is known to be computationally hard for.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本