Skip to main content

Power of Algorithms in Discrete Optimisation

Periodic Reporting for period 3 - PowAlgDO (Power of Algorithms in Discrete Optimisation)

Reporting period: 2020-01-01 to 2021-06-30

The recent work on the project included the understanding of hardness for promise CSPs, and the role of #BIS (independent sets in bipartite graphs) in counting complexity of homomorphism problems related to CSPs. This is well aligned with the overall project goal of understanding the complexity of CSPs and its variants.
Main results include several complexity classifications for various fragments of constraint satisfaction problems.
Summary of keywords