Código QR

Small Promise CSPs that reduce to large CSPs

For relational structures A, B of the same signature, the Promise Constraint Satisfaction Problem PCSP(A,B) asks whether a given input structure maps homomorphically to A or does not even map to B. We are promised that the input satisfies exactly one of these two cases. If there exists a structure...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Alexandr Kazda, Peter Mayr, Dmitriy Zhuk
Formato: Artigo
Lenguaje:Inglês
Publicado: Logical Methods in Computer Science e.V. 2022-08-01
Colección:Logical Methods in Computer Science
Materias:
Acceso en línea:https://lmcs.episciences.org/8495/pdf
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!