A dichotomy for succinct representations of homomorphisms

DOI10.4230/LIPICS.ICALP.2023.113MaRDI QIDQ6638121zbMATH OpenFDO

Authors Christoph Berkholz, Harry Vinall-Smeeth

Publication date 14 November 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2023.113

zbMATH Keywords

CSPenumerationhomomorphism problemlower boundsuccinct representationstreewidth

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cited in

(2)

• A characterization of efficiently compilable constraint languages
• A formal language perspective on factorized representations

This page was built for publication: A dichotomy for succinct representations of homomorphisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6638121)