Fast and parallel decomposition of constraint satisfaction problems

Constraint Satisfaction Problems (CSP) are notoriously hard. Consequently, powerful decomposition methods have been developed to overcome this complexity. However, this poses the challenge of actually computing such a decomposition for a given CSP instance, and previous algorithms have shown their l...

Descripción completa

Detalles Bibliográficos
Autores principales: Gottlob, Georg, Okulmus, Cem, Pichler, Reinhard
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer US 2022
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9360169/
https://www.ncbi.nlm.nih.gov/pubmed/35965950
http://dx.doi.org/10.1007/s10601-022-09332-1

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9360169/
https://www.ncbi.nlm.nih.gov/pubmed/35965950
http://dx.doi.org/10.1007/s10601-022-09332-1

Ejemplares similares