共 50 条
- [4] The complexity of counting graph homomorphisms (extended abstract) PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 246 - 255
- [7] The Complexity of Counting Planar Graph Homomorphisms of Domain Size 3 PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023, 2023, : 1285 - 1297
- [8] Complexity Classification of Counting Graph Homomorphisms Modulo a Prime Number PROCEEDINGS OF THE 54TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '22), 2022, : 1024 - 1037
- [10] The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2019), 2019, 11789 : 364 - 378