Abstract: Graph homomorphism problem has been studied intensively. Given an m ×m symmetric matrix A, the graph homomorphism function Z A (G) is defined as
External IDs:dblp:conf/icalp/CaiCL10
Loading
OpenReview is a long-term project to advance science through improved peer review with legal nonprofit status. We gratefully acknowledge the support of the OpenReview Sponsors. © 2026 OpenReview