Complexity of Counting Weighted Eulerian Orientations with ARS

04/04/2019
by   Jin-Yi Cai, et al.
0

Unique prime factorization of integers is taught in every high school. We define and explore a notion of unique prime factorization for constraint functions, and use this as a new tool to prove a complexity classification for counting weighted Eulerian orientation problems with arrow reversal symmetry (ARS). We establish a novel connection between counting constraint satisfaction problems and counting weighted Eulerian orientation problems that is global in nature, and is based on the determination of half-weighted affine linear subspaces.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/08/2021

Complexity classification of counting graph homomorphisms modulo a prime number

Counting graph homomorphisms and its generalizations such as the Countin...
research
02/16/2018

Counting Homomorphisms to Trees Modulo a Prime

Many important graph theoretic notions can be encoded as counting graph ...
research
11/09/2020

On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order

We study the problem of counting the number of homomorphisms from an inp...
research
12/28/2020

Counting the Number of Solutions to Constraints

Compared with constraint satisfaction problems, counting problems have r...
research
04/20/2023

Counting Computations with Formulae: Logical Characterisations of Counting Complexity Classes

We present quantitative logics with two-step semantics based on the fram...
research
11/02/2018

Holant clones and the approximability of conservative holant problems

We construct a theory of holant clones to capture the notion of expressi...
research
01/30/2023

On the Complexity of Enumerating Prime Implicants from Decision-DNNF Circuits

We consider the problem EnumIP of enumerating prime implicants of Boolea...

Please sign up or login with your details

Forgot password? Click here to reset