Conservative Modular Counting at Every Odd PrimeResearch Paper
A constraint satisfaction problem over a fixed finite relational template asks about assignments of values in to variables subject to constraints . Counting the satisfying assignments exactly is the subject of the Dyer–Richerby dichotomy (DR): for every template it is either in FP or #P-complete, and the tractable…