Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy
From MaRDI portal
Publication:4635829
DOI10.1109/LICS.2015.52zbMath1401.68104OpenAlexW1560586330MaRDI QIDQ4635829
Arash Rafiey, Victor Dalmau, László Egri, Benoit Larose, Pavol Hell
Publication date: 23 April 2018
Published in: 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/lics.2015.52
Analysis of algorithms and problem complexity (68Q25) Descriptive complexity and finite models (68Q19)
Related Items (6)
Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Algebra and the Complexity of Digraph CSPs: a Survey ⋮ List H-coloring a graph by removing few vertices ⋮ Graph isomorphism restricted by lists
This page was built for publication: Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy