Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Topology and adjunction in promise constraint satisfaction (2003.11351v3)

Published 25 Mar 2020 in cs.CC, cs.DM, cs.LO, and math.AT

Abstract: The approximate graph colouring problem, whose complexity is unresolved in most cases, concerns finding a $c$-colouring of a graph that is promised to be $k$-colourable, where $c\geq k$. This problem naturally generalises to promise graph homomorphism problems and further to promise constraint satisfaction problems. The complexity of these problems has recently been studied through an algebraic approach. In this paper, we introduce two new techniques to analyse the complexity of promise CSPs: one is based on topology and the other on adjunction. We apply these techniques, together with the previously introduced algebraic approach, to obtain new unconditional NP-hardness results for a significant class of approximate graph colouring and promise graph homomorphism problems.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Andrei Krokhin (15 papers)
  2. Jakub Opršal (21 papers)
  3. Marcin Wrochna (29 papers)
  4. Stanislav Živný (42 papers)
Citations (32)

Summary

We haven't generated a summary for this paper yet.