We employ algebraic tools to investigate the computational complexity of certain problems. More precisely, the research is focused on Promise Constraint Satisfaction Problem (PCSP) on a Boolean domain.
An example of a Promise CSP is the approximate coloring problem: deciding whether the chromatic number of a graph is at most 3 or at least 17. The doctoral research aims to investigate the computational complexity of such problems, but defined on a Boolean domain.