Algebraic theory of promise constraint satisfaction problems, first steps

DOI10.1007/978-3-030-25027-0_1OpenAlexW2965983164MaRDI QIDQ2291410

Libor Barto

Publication date: 30 January 2020

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

zbMATH Keywords

computational complexitypolymorphismpromise constraint satisfaction

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Algebraic theory of promise constraint satisfaction problems, first steps