NP #P = ∃PP and other remarks about maximized counting - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2022

NP #P = ∃PP and other remarks about maximized counting

David Monniaux

Abstract

We consider the following decision problem DMAX#SAT, and generalizations thereof: given a quantifier-free propositional formula F (x, y), where x, y are tuples of variables, and a bound B, determine if there is x such that #{y | F (x, y)} ≥ B. This is the decision version of the problem of MAX#SAT: finding x and B for maximal B.
Fichier principal
Vignette du fichier
counting_complexity.pdf (69.98 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03586193 , version 1 (23-02-2022)

Identifiers

Cite

David Monniaux. NP #P = ∃PP and other remarks about maximized counting. 2022. ⟨hal-03586193⟩
260 View
62 Download

Altmetric

Share

Gmail Facebook X LinkedIn More