Người báo cáo: Phạm Văn Trung (Viện Toán học)
Thời gian: 9h, Thứ tư 6/12/2017.
Địa điểm: Phòng Semina Tầng 6, Nhà A6, Viện Toán học, 18 Hoàng Quốc Việt, Hà Nội
Tóm tắt: 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.
|
