Journal article icon

Journal article

Topology and adjunction in promise constraint satisfaction

Abstract:

The approximate graph coloring problem, whose complexity is unresolved in most cases, concerns finding a c-coloring of a graph that is promised to be k-colorable, where c≥k. This problem naturally generalizes 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 analyze the complexity of promise CSPs: one is based...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1137/20M1378223

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Oxford college:
Jesus College
Role:
Author
ORCID:
0000-0002-0263-159X
More from this funder
Name:
Royal Society
Grant:
URF\R\180000
More from this funder
Name:
European Commission
Grant:
714532
Publisher:
Society for Industrial and Applied Mathematics
Journal:
SIAM Journal on Computing More from this journal
Volume:
52
Issue:
1
Pages:
38-79
Publication date:
2023-02-14
Acceptance date:
2022-09-23
DOI:
EISSN:
1095-7111
ISSN:
0097-5397
Language:
English
Keywords:
Pubs id:
1279635
Local pid:
pubs:1279635
Deposit date:
2022-09-23

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP