Topology and adjunction in promise constraint satisfaction

DOI10.1137/20M1378223arXiv2003.11351MaRDI QIDQ6337399

Andrei A. Krokhin, Marcin Wrochna, Jakub Opršal, Stanislav Živný

Publication date: 25 March 2020

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Topology and adjunction in promise constraint satisfaction