In this talk we will survey the algebraic approach to study the  
computational complexity of the constraint satisfaction problem (CSP).  
We will cover the basic terminology consisting of polymorphisms,  
clones, primitive positive definitions, relational clones, and explain  
a recent result concerning the time complexity of NP-hard  
finite-domain CSPs.