Given a propositional formula ψ, the model counting problem, also referred to as #SAT, seeks compute number of satisfying assignments (or models) ψ. Modern search-based algorithms are built on conflict-driven clause learning, combined with caching certain subformulas (called components) encountered during search process. Despite significant progress in these over years, state-of-the-art counter...

A bstract We investigate, for the first time, a scenario where dark matter consists of three complex scalar fields that are stabilized by single Z 7 symmetry. As an extension well-known Higgs-portal, this model is also subject to important restrictions arising from relic density constraint and direct detection experiments. Our goal in paper find characterize viable regions model, analyze its pr...