NP $^{\#P}$ = $\exists$ PP和有关最大化计数的其他备注
NP$^{\#P}$ = $\exists$PP and other remarks about maximized counting
摘要:
我们考虑以下决策问题DMAX#SAT及其推广:给定一个无量词命题公式$F(\mathbf{x},\mathbf{y})$,其中$\mathbf{x},\mathbf{y}$是变量的元组,和一个约束$B$,确定是否存在$\vec{x}$使得$\#\{\mathbf{y} \mid F(\mathbf{x},\mathbf{y})\} \geq B$ .这是MAX#SAT问题的决策版本:寻找最大$B$的$\mathbf{x}$和$B$。
英文摘要:
We consider the following decision problem DMAX#SAT, and generalizations thereof: given a quantifier-free propositional formula $F(\mathbf{x},\mathbf{y})$, where $\mathbf{x},\mathbf{y}$ are tuples of variables, and a bound $B$, determine if there is $\vec{x}$ such that $\#\{\mathbf{y} \mid F(\mathbf{x},\mathbf{y})\} \geq B$. This is the decision version of the problem of MAX#SAT: finding $\mathbf{x}$ and $B$ for maximal $B$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。