Counting Homomorphisms to Square-Free Graphs, Modulo 2

We study the problem ⊕HomsTo<em>H</em> of counting, modulo 2, the homomorphisms from an input graph to a fixed undirected graph <em>H</em>. A characteristic feature of modular counting is that cancellations make wider classes of instances tractable than is the case for exact...

Disgrifiad llawn

Manylion Llyfryddiaeth
Prif Awduron: Gobel, A, Goldberg, L, Richerby, D
Fformat: Conference item
Iaith:English
Cyhoeddwyd: Schloss Dagstuhl - LZI GmbH 2015

Eitemau Tebyg