Scholarlink

Abstract <p> The counting version of the maximum 2-satisfiability problem is considered. A parsimonious reduction of the satisfiability problem to the maximum 2-satisfiability problem is constructed, proving the computational hardness of the counting version of the maximum 2-satisfiability problem. </p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

On the Counting Version of the Maximum 2-Satisfiability Problem

  • 期刊论文

  • 发表日期：

    2025年10月1日

查看全文
  • V. Yu. Popov

摘要

Abstract

The counting version of the maximum 2-satisfiability problem is considered. A parsimonious reduction of the satisfiability problem to the maximum 2-satisfiability problem is constructed, proving the computational hardness of the counting version of the maximum 2-satisfiability problem.