Dichotomy and Polymorphisms

Please enable javascript in your browser.

Yasaee Meybodi, Fatemeh | 2016

944 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 48288 (02)
University: Sharif University of Technology
Department: Mathematical Sciences
Advisor(s): Daneshgar, Amir
Abstract:
In general, Constrain Satisfaction Problems (CSP’s) are NP-complete, however, this is not the case, if we impose some restrictions on the constraints. Due to importance and applications of CSP’s in different areas of engineering and science including artificial intelligence, relational databases and logic, investigating the computational complexity of CSP’s is an important issue. Computational complexity of CSP’s has been investigated from a variety of aspects, including the Universal Algebraic approach that has given rise to a solution of dichotomy conjecture recently. In this thesis based on contributions of Bulatov, Krokhin and Jeavons, we try to explain this universal algebraic approach that uses Galois connections and reductions between
CSP’s
Keywords:
Computational Complexity ; Dichotomous ; Constraint Satisfaction ; Polymorphisms ; Universal Algebra