Speaker: Pham Van Trung
Time: 9h00, Wednesday, December 6, 2017
Location: Room semina, Floor 6th, Building A6,, Institute of Mathematics, 18 Hoang Quoc Viet, Cau Giay, Hanoi
Abstract: Constraint satisfaction problems (CSPs) are fundamental problems in computer science. The famous Feder-Vardi dichotomy conjecture on CSPs on finite domains has been solved recently (the proofs are still in process of verifying). The CSPs on infinite domains are considerable generalization of the finite CSPs. In this talk we introduce the problems, present some of our recent results and the interactions with other areas of mathematics.
|
