Promise constraint satisfaction problems
<p>The promise constraint satisfaction problem (PCSP) is a recently introduced vast generalisation of the constraint satisfaction problem (CSP) that captures approximability of satisfiable instances. A PCSP instance comes with two forms of each constraint: a strict one and a weak one. Given t...
Main Author: | Brandts-Longtin, A |
---|---|
Other Authors: | Zivny, S |
Format: | Thesis |
Language: | English |
Published: |
2022
|
Subjects: |
Similar Items
-
The complexity of meta-computational problems
by: Rajgopal, N
Published: (2020) -
A Characterisation of First-Order Constraint Satisfaction Problems
by: Benoit Larose, et al.
Published: (2007-11-01) -
Structural results for total search complexity classes with applications to game theory and optimisation
by: Hollender, A
Published: (2021) -
Hybrid tractability of constraint satisfaction problems with global constraints
by: Thorstensen, E
Published: (2013) -
Randomised algorithms for low temperature spin systems
by: Stewart, J
Published: (2022)