Welcome to the UPF Digital Repository

Browsing Articles (Departament de Tecnologies de la Informació i les Comunicacions) by Subject "Near-unanimity polymorphism"

Browsing Articles (Departament de Tecnologies de la Informació i les Comunicacions) by Subject "Near-unanimity polymorphism"

Sort by: Order: Results:

  • Dalmau, Víctor; Kozik, Marcin; Krokhin, Andrei; Makarychev, Konstantin; Makarychev, Yury; Opršal, Jakub (SIAM (Society for Industrial and Applied Mathematics), 2019)
    An instance of the constraint satisfaction problem (CSP) is given by a family of constraints on overlapping sets of variables, and the goal is to assign values from a fixed domain to the variables so that all constraints ...

Search DSpace


Advanced Search

Browse

My Account

Compliant to Partaking