z-logo
open-access-imgOpen Access
Fine-Grained Complexity of Constraint Satisfaction Problems through Partial Polymorphisms: A Survey (Dedicated to the memory of Professor Ivo Rosenberg)
Author(s) -
Miguel Couceiro,
Lucien Haddad,
Victor Lagerkvist
Publication year - 2019
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - constraint satisfaction problem , complexity of constraint satisfaction , universal algebra , constraint satisfaction , constraint (computer aided design) , domain (mathematical analysis) , computer science , algebra over a field , computational complexity theory , theoretical computer science , mathematics , local consistency , algorithm , artificial intelligence , pure mathematics , geometry , probabilistic logic , mathematical analysis

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom