About this paper

Investigates how algebraic structure in a CSP solution space can be encoded as another fixed-template problem.

The paper studies representations of solution sets as subalgebras of products of specified algebras. It develops reductions and tractability results using a CSP with an input prototype. A recorded presentation is available below.