scientific article; zbMATH DE number 7724184

DOI10.4230/lipics.mfcs.2021.11arXiv2010.04618MaRDI QIDQ6168421

Unnamed Author, Libor Barto

Publication date: 8 August 2023

Full work available at URL: https://arxiv.org/abs/2010.04618

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polymorphismconstraint satisfaction problemspromise constraint satisfactionBoolean PCSPfinite tractabilityhomomorphic relaxation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Small Promise CSPs that reduce to large CSPs ⋮ Local–global property for G-invariant terms

This page was built for publication: