On algorithms based on finitely many homomorphism counts

DOI10.4230/LIPICS.MFCS.2022.32MaRDI QIDQ6584027zbMATH OpenFDO

Authors Yijia Chen, Jörg Flum, Mingjun Liu, Zhiyang Xun

Publication date 6 August 2024

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2022.32

zbMATH Keywords

adaptive Hom algorithmsHom algorithmshomomorphism numbers

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(4)

• When do homomorphism counts help in query algorithms?
• The complexity of homomorphism reconstructibility
• The complexity of homomorphism reconstructibility
• Adaptive query algorithms for relational structures based on homomorphism counts

This page was built for publication: On algorithms based on finitely many homomorphism counts

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